grape.ensmallen.datasets.networkrepository

This sub-module offers methods to automatically retrieve the graphs from NetworkRepository repository.

View Source
"""This sub-module offers methods to automatically retrieve the graphs from NetworkRepository repository."""

from .c5009 import C5009
from .opsahlsouthernwomen import OpsahlSouthernwomen
from .socfbnorthwestern25 import SocfbNorthwestern25
from .gen400p0965 import Gen400P0965
from .gen400p0975 import Gen400P0975
from .san400073 import San400073
from .g29 import G29
from .cl10002d1trial1 import Cl10002d1Trial1
from .g39 import G39
from .socfbusc35 import SocfbUsc35
from .jagmesh7 import Jagmesh7
from .aa3 import Aa3
from .zhishizhwikiinternallink import ZhishiZhwikiInternallink
from .sw100030d2trial3 import Sw100030d2Trial3
from .techascaida import TechAsCaida
from .scldoor import ScLdoor
from .trec9 import Trec9
from .socfbbowdoin47 import SocfbBowdoin47
from .bcsstm39 import Bcsstm39
from .dsjc5005 import Dsjc5005
from .p2pgnutella30 import P2pGnutella30
from .tube2 import Tube2
from .email import Email
from .nr208bit import NR208bit
from .ex6 import Ex6
from .sw100030d1trial2 import Sw100030d1Trial2
from .sw100040d3trial3 import Sw100040d3Trial3
from .cl100001d8trial1 import Cl100001d8Trial1
from .manna9 import MannA9
from .hamming104 import Hamming104
from .bioscht import BioScHt
from .infeuroroad import InfEuroroad
from .cl1000001d7trial1 import Cl1000001d7Trial1
from .manna81 import MannA81
from .tsyl201 import Tsyl201
from .g4 import G4
from .sw1000050d3trial2 import Sw1000050d3Trial2
from .yahoomsg import YahooMsg
from .skirt import Skirt
from .net150 import Net150
from .dbpediateam import DbpediaTeam
from .powerbcspwr09 import PowerBcspwr09
from .dictionary28 import Dictionary28
from .trec10 import Trec10
from .barth5 import Barth5
from .foldoc import Foldoc
from .sw10040d1trial2 import Sw10040d1Trial2
from .bcsstm06 import Bcsstm06
from .sw1000060d1trial2 import Sw1000060d1Trial2
from .sw10040d2trial3 import Sw10040d2Trial3
from .ecostmarks import EcoStmarks
from .sw1000060d2trial3 import Sw1000060d2Trial3
from .patentcite import Patentcite
from .johnson3224 import Johnson3224
from .emaileuall import EmailEuall
from .socsinaweibo import SocSinaweibo
from .cage14 import Cage14
from .g16 import G16
from .cl10001d9trial1 import Cl10001d9Trial1
from .actorcollaboration import ActorCollaboration
from .kohonen import Kohonen
from .sochighschoolmoreno import SocHighschoolMoreno
from .biplane9 import Biplane9
from .brock4001 import Brock4001
from .plc4030l5 import Plc4030L5
from .socfbmsu24 import SocfbMsu24
from .socfbjohnshopkins55 import SocfbJohnshopkins55
from .ljournal2008 import Ljournal2008
from .ig518 import Ig518
from .g64 import G64
from .rajat08 import Rajat08
from .finance256 import Finance256
from .soclivejournal import SocLivejournal
from .air06 import Air06
from .cl100002d0trial1 import Cl100002d0Trial1
from .febody import FeBody
from .bcsstk31 import Bcsstk31
from .socanuresidence import SocAnuResidence
from .engine import Engine
from .sw10030d3trial3 import Sw10030d3Trial3
from .cage3 import Cage3
from .cahepth import CaHepth
from .foodwebbaydry import FoodwebBaydry
from .socfboberlin44 import SocfbOberlin44
from .soctwitter import SocTwitter
from .cl1000001d9trial3 import Cl1000001d9Trial3
from .miscimdbbi import MiscImdbBi
from .pkustk04 import Pkustk04
from .pkustk14 import Pkustk14
from .bnhumanjung import BNHumanJung
from .sw10050d1trial1 import Sw10050d1Trial1
from .bioscts import BioScTs
from .g52 import G52
from .sw100060d2trial1 import Sw100060d2Trial1
from .dbpediarecordlabel import DbpediaRecordlabel
from .g42 import G42
from .powerbcspwr10 import PowerBcspwr10
from .cl10000002d0trial1 import Cl10000002d0Trial1
from .socfbmaryland58 import SocfbMaryland58
from .rw496 import Rw496
from .se import Se
from .cl10k1d8l5 import Cl10k1d8L5
from .roadnetpa import RoadnetPa
from .bcspwr03 import Bcspwr03
from .socdelicious import SocDelicious
from .g30 import G30
from .roadnetherlandsosm import RoadNetherlandsOsm
from .dolphins import Dolphins
from .infroadnetpa import InfRoadnetPa
from .socfbbc17 import SocfbBc17
from .pcrystk03 import Pcrystk03
from .struct3 import Struct3
from .techarenasmeta import TechArenasMeta
from .bcsstm20 import Bcsstm20
from .patents import Patents
from .affflickrusergroups import AffFlickrUserGroups
from .ash958 import Ash958
from .phat15003 import PHat15003
from .tf13 import Tf13
from .cl10000001d8trial1 import Cl10000001d8Trial1
from .socfbhoward90 import SocfbHoward90
from .enzymes8 import Enzymes8
from .cfat2002 import CFat2002
from .rajat01 import Rajat01
from .sw1000030d2trial1 import Sw1000030d2Trial1
from .pds10 import Pds10
from .socdolphins import SocDolphins
from .ig511 import Ig511
from .lshp1561 import Lshp1561
from .ash292 import Ash292
from .socfbamerican75 import SocfbAmerican75
from .socfbmit import SocfbMit
from .gupta1 import Gupta1
from .socfbhamilton46 import SocfbHamilton46
from .san200072 import San200072
from .dsjc10005 import Dsjc10005
from .cl1000002d1trial3 import Cl1000002d1Trial3
from .p2pgnutella06 import P2pGnutella06
from .packing500x100x100b050 import Packing500x100x100B050
from .biocegt import BioCeGt
from .actormovie import ActorMovie
from .miscjungcodedep import MiscJungCodeDep
from .phat3003 import PHat3003
from .socslashdot import SocSlashdot
from .data import Data
from .ash331 import Ash331
from .uk2002 import Uk2002
from .erdos992 import Erdos992
from .erdos982 import Erdos982
from .ig58 import Ig58
from .phat10002 import PHat10002
from .uspowergrid import Uspowergrid
from .affgithubuser2project import AffGithubUser2project
from .rtretweet import RtRetweet
from .copresencethiers13 import CopresenceThiers13
from .chesapeake import Chesapeake
from .sstmodel import Sstmodel
from .sw1000040d3trial1 import Sw1000040d3Trial1
from .johnson844 import Johnson844
from .sw10060d3trial1 import Sw10060d3Trial1
from .cl10001d7trial3 import Cl10001d7Trial3
from .affamazoncopurchases import AffAmazonCopurchases
from .camathscinetdir import CaMathscinetDir
from .g43 import G43
from .g53 import G53
from .affdigg import AffDigg
from .sw100060d1trial1 import Sw100060d1Trial1
from .cacondmat import CaCondmat
from .dblpcite import DblpCite
from .cl1000001d9trial2 import Cl1000001d9Trial2
from .sw10050d2trial1 import Sw10050d2Trial1
from .amazon0302 import Amazon0302
from .amazon0312 import Amazon0312
from .techp2pgnutella import TechP2pGnutella
from .fbcmucarnegie49 import FbCmuCarnegie49
from .biocecx import BioCeCx
from .barth import Barth
from .pkustk05 import Pkustk05
from .srb1 import Srb1
from .webindochina2004all import WebIndochina2004All
from .pcrystk02 import Pcrystk02
from .socslashdottrustall import SocSlashdotTrustAll
from .maayanfigeys import MaayanFigeys
from .biocelegans import BioCelegans
from .as735 import As735
from .bcsstm21 import Bcsstm21
from .asskitter import AsSkitter
from .hollywood2009 import Hollywood2009
from .caerdos992 import CaErdos992
from .dd497 import Dd497
from .arenasmeta import ArenasMeta
from .socfbfsu53 import SocfbFsu53
from .canetscience import CaNetscience
from .soctwitterfollows import SocTwitterFollows
from .avessparrowsocial import AvesSparrowSocial
from .socfbcmu import SocfbCmu
from .scpkustk11 import ScPkustk11
from .webepa import WebEpa
from .bcspwr02 import Bcspwr02
from .g31 import G31
from .chem97zt import Chem97zt
from .techinternetas import TechInternetAs
from .socfbwake73 import SocfbWake73
from .zhishibaiduinternallink import ZhishiBaiduInternallink
from .bfly import Bfly
from .avesweaversocial import AvesWeaverSocial
from .dbpediacountry import DbpediaCountry
from .net25 import Net25
from .biohumangene1 import BioHumanGene1
from .cl1000002d1trial2 import Cl1000002d1Trial2
from .zhishihudonginternallink import ZhishiHudongInternallink
from .bcsstk29 import Bcsstk29
from .biocepg import BioCePg
from .socpokec import SocPokec
from .us04 import Us04
from .sw1000030d1trial1 import Sw1000030d1Trial1
from .copter2 import Copter2
from .socfbmichigan23 import SocfbMichigan23
from .brock2004 import Brock2004
from .tf12 import Tf12
from .phat15002 import PHat15002
from .youtubegroupmemberships import YoutubeGroupmemberships
from .connectus import Connectus
from .ig510 import Ig510
from .roadgermanyosm import RoadGermanyOsm
from .rajat10 import Rajat10
from .biohscx import BioHsCx
from .ecofoodwebbaywet import EcoFoodwebBaywet
from .bas1lp import Bas1lp
from .ig59 import Ig59
from .rtretweetcrawl import RtRetweetCrawl
from .socfbwisconsin87 import SocfbWisconsin87
from .glossgt import Glossgt
from .cl10001d7trial2 import Cl10001d7Trial2
from .socgoogleplus import SocGooglePlus
from .phat10003 import PHat10003
from .lshp2233 import Lshp2233
from .pfinan512 import Pfinan512
from .maayanfaa import MaayanFaa
from .roadnettx import RoadnetTx
from .sw100050d3trial1 import Sw100050d3Trial1
from .caaminer import CaAminer
from .socfbtexas80 import SocfbTexas80
from .sw100030d2trial2 import Sw100030d2Trial2
from .zhishibaidurelatedpages import ZhishiBaiduRelatedpages
from .wbcsstanford import WbCsStanford
from .jagmesh6 import Jagmesh6
from .sw100030d1trial3 import Sw100030d1Trial3
from .p2pgnutella31 import P2pGnutella31
from .reactome import Reactome
from .github import Github
from .socfbberkeley13 import SocfbBerkeley13
from .zhishihudongrelatedpages import ZhishiHudongRelatedpages
from .trec8 import Trec8
from .san400072 import San400072
from .webitalycnr2000 import WebItalycnr2000
from .webstanford import WebStanford
from .webindochina2004 import WebIndochina2004
from .socfbnortheastern19 import SocfbNortheastern19
from .stanford import Stanford
from .cfat5001 import CFat5001
from .socsignbitcoinotc import SocSignBitcoinotc
from .flickr import Flickr
from .g38 import G38
from .sw1000050d3trial3 import Sw1000050d3Trial3
from .g5 import G5
from .scshipsec1 import ScShipsec1
from .socfbcolgate88 import SocfbColgate88
from .arabic2005 import Arabic2005
from .ccc import Ccc
from .barth4 import Barth4
from .c20009 import C20009
from .soclastfm import SocLastfm
from .trec11 import Trec11
from .socbuzznet import SocBuzznet
from .usroads48 import Usroads48
from .biogridworm import BioGridWorm
from .sw100040d3trial2 import Sw100040d3Trial2
from .socfbnotredame57 import SocfbNotredame57
from .epa import Epa
from .ermd import ErMd
from .g17 import G17
from .socfbindiana69 import SocfbIndiana69
from .cvxbqp1 import Cvxbqp1
from .sw1000060d1trial3 import Sw1000060d1Trial3
from .hugebubbles00010 import Hugebubbles00010
from .sw10040d1trial3 import Sw10040d1Trial3
from .hugebubbles00000 import Hugebubbles00000
from .socfbcolumbia2 import SocfbColumbia2
from .cage15 import Cage15
from .sw1000060d2trial2 import Sw1000060d2Trial2
from .roadusroads import RoadUsroads
from .socacademia import SocAcademia
from .sw10040d2trial2 import Sw10040d2Trial2
from .karate import Karate
from .sw10030d3trial2 import Sw10030d3Trial2
from .sanr20009 import Sanr20009
from .bcsstk30 import Bcsstk30
from .cl10m1d8l5 import Cl10m1d8L5
from .wordnetwords import WordnetWords
from .miscfootball import MiscFootball
from .egogplus import EgoGplus
from .socfbunc28 import SocfbUnc28
from .webedu import WebEdu
from .cagrqc import CaGrqc
from .biowormnetv3 import BioWormnetV3
from .mri1 import Mri1
from .rajat09 import Rajat09
from .g65 import G65
from .grid1 import Grid1
from .hamming62 import Hamming62
from .gearbox import Gearbox
from .bcsstm23 import Bcsstm23
from .techascaida20071105 import TechAsCaida20071105
from .webberkstandir import WebBerkstanDir
from .socpokecrelationships import SocPokecRelationships
from .socadvogato import SocAdvogato
from .roadgreatbritainosm import RoadGreatBritainOsm
from .brock8004 import Brock8004
from .socfbstanford3 import SocfbStanford3
from .roadminnesota import RoadMinnesota
from .webspamdetection import WebSpamDetection
from .bcspwr10 import Bcspwr10
from .g23 import G23
from .scpkustk13 import ScPkustk13
from .chem97ztz import Chem97ztz
from .ecoeverglades import EcoEverglades
from .socfbkonect import SocfbKonect
from .youtubelinks import YoutubeLinks
from .sphere3 import Sphere3
from .emailuniv import EmailUniv
from .ascaida20071105 import AsCaida20071105
from .cl10000002d0trial2 import Cl10000002d0Trial2
from .sw100060d1trial3 import Sw100060d1Trial3
from .lshp1270 import Lshp1270
from .g51 import G51
from .sw100060d2trial2 import Sw100060d2Trial2
from .petstercarnivore import PetsterCarnivore
from .g41 import G41
from .pkustk07 import Pkustk07
from .sw10050d1trial2 import Sw10050d1Trial2
from .dbpediaoccupation import DbpediaOccupation
from .socfbmaine59 import SocfbMaine59
from .socfbuillinois20 import SocfbUillinois20
from .socfbcarnegie49 import SocfbCarnegie49
from .techp2p import TechP2p
from .sw10050d2trial3 import Sw10050d2Trial3
from .football import Football
from .phat10001 import PHat10001
from .sw1000040d3trial2 import Sw1000040d3Trial2
from .c10009 import C10009
from .sw10060d3trial2 import Sw10060d3Trial2
from .erdos991 import Erdos991
from .dd199 import Dd199
from .webwikipedia2009 import WebWikipedia2009
from .erdos981 import Erdos981
from .webuk2005 import WebUk2005
from .socfbbaylor93 import SocfbBaylor93
from .fe4elt2 import Fe4elt2
from .abb313 import Abb313
from .trecwt10g import TrecWt10g
from .socfbreed98 import SocfbReed98
from .sw100050d3trial3 import Sw100050d3Trial3
from .socfbnyu9 import SocfbNyu9
from .p2pgnutella05 import P2pGnutella05
from .ecofoodwebbaydry import EcoFoodwebBaydry
from .gupta2 import Gupta2
from .san200071 import San200071
from .advogato import Advogato
from .socfbbu10 import SocfbBu10
from .cacoauthorsdblp import CaCoauthorsDblp
from .cfat2001 import CFat2001
from .rttwittercopen import RtTwitterCopen
from .roaditalyosm import RoadItalyOsm
from .biogridfruitfly import BioGridFruitfly
from .socfbduke14 import SocfbDuke14
from .sw1000030d2trial2 import Sw1000030d2Trial2
from .rajat02 import Rajat02
from .ig512 import Ig512
from .opsahlusairport import OpsahlUsairport
from .socfbusf51 import SocfbUsf51
from .socgplus import SocGplus
from .tf10 import Tf10
from .troll import Troll
from .cl10000001d8trial2 import Cl10000001d8Trial2
from .techpgp import TechPgp
from .sw1000030d1trial3 import Sw1000030d1Trial3
from .copresenceinvs15 import CopresenceInvs15
from .trec13 import Trec13
from .webgoogledir import WebGoogleDir
from .ascaida import AsCaida
from .cca import Cca
from .fetooth import FeTooth
from .sw1000050d3trial1 import Sw1000050d3Trial1
from .g7 import G7
from .g48 import G48
from .socfbor import SocfbOr
from .socfbuc61 import SocfbUc61
from .g58 import G58
from .caastroph import CaAstroph
from .cl1000001d7trial2 import Cl1000001d7Trial2
from .biodmht import BioDmHt
from .socfbupenn7 import SocfbUpenn7
from .emaileu import EmailEu
from .ecoflorida import EcoFlorida
from .cage9 import Cage9
from .cl100001d8trial2 import Cl100001d8Trial2
from .dbpediagenre import DbpediaGenre
from .tube1 import Tube1
from .ex5 import Ex5
from .sw100030d1trial1 import Sw100030d1Trial1
from .jagmesh4 import Jagmesh4
from .nr145bit import NR145bit
from .journals import Journals
from .hamming84 import Hamming84
from .hepth import HepTh
from .lock3491 import Lock3491
from .eva import Eva
from .cl10002d1trial2 import Cl10002d1Trial2
from .geom import Geom
from .bcspwr09 import Bcspwr09
from .socfbtufts18 import SocfbTufts18
from .soctwittermpisws import SocTwitterMpiSws
from .soctwitterfollowsmun import SocTwitterFollowsMun
from .socfbmu78 import SocfbMu78
from .cl100002d0trial2 import Cl100002d0Trial2
from .bcsstk32 import Bcsstk32
from .roadnetca import RoadnetCa
from .affwikiwordbypage import AffWikiWordbypage
from .as20000102 import As20000102
from .cnr2000 import Cnr2000
from .infroadnetca import InfRoadnetCa
from .jgl009 import Jgl009
from .air05 import Air05
from .rail2586 import Rail2586
from .pwt import Pwt
from .socepinions1 import SocEpinions1
from .g67 import G67
from .tf19 import Tf19
from .pattern1 import Pattern1
from .socfbuva16 import SocfbUva16
from .nasa4704 import Nasa4704
from .techcaidarouterlevel import TechCaidarouterlevel
from .cs4 import Cs4
from .ash608 import Ash608
from .hugetric00000 import Hugetric00000
from .hugetric00010 import Hugetric00010
from .bioyeastproteininter import BioYeastProteinInter
from .socfirmhitech import SocFirmHiTech
from .g15 import G15
from .socorkut import SocOrkut
from .miscreuters911 import MiscReuters911
from .cl10001d9trial2 import Cl10001d9Trial2
from .in2004 import In2004
from .brock4002 import Brock4002
from .netz4504 import Netz4504
from .powerusgrid import PowerUsGrid
from .roadeuroroad import RoadEuroroad
from .bcsstm05 import Bcsstm05
from .ragusa16 import Ragusa16
from .opsahlpowergrid import OpsahlPowergrid
from .socfbusfca72 import SocfbUsfca72
from .sw10040d1trial1 import Sw10040d1Trial1
from .socfboklahoma97 import SocfbOklahoma97
from .sw1000060d1trial1 import Sw1000060d1Trial1
from .socdouban import SocDouban
from .socfbbucknell39 import SocfbBucknell39
from .cl1000001d7trial3 import Cl1000001d7Trial3
from .caactorcollaboration import CaActorCollaboration
from .nr3elt import NR3elt
from .websk2005 import WebSk2005
from .cl100001d8trial3 import Cl100001d8Trial3
from .sw100040d3trial1 import Sw100040d3Trial1
from .cage8 import Cage8
from .citpatent import CitPatent
from .biohslc import BioHsLc
from .trec12 import Trec12
from .caidarouterlevel import Caidarouterlevel
from .dbpedialocation import DbpediaLocation
from .g59 import G59
from .g49 import G49
from .g6 import G6
from .it2004 import It2004
from .cfat5002 import CFat5002
from .bcspwr08 import Bcspwr08
from .cl10002d1trial3 import Cl10002d1Trial3
from .san400071 import San400071
from .socfbuf21 import SocfbUf21
from .slashdotzoo import SlashdotZoo
from .sw1000060d3l2 import Sw1000060d3L2
from .ex4 import Ex4
from .orkutlinks import OrkutLinks
from .ibm32 import Ibm32
from .appu import Appu
from .sw100030d2trial1 import Sw100030d2Trial1
from .socdogster import SocDogster
from .jagmesh5 import Jagmesh5
from .grid2 import Grid2
from .g66 import G66
from .mri2 import Mri2
from .diag import Diag
from .socfbuchicago30 import SocfbUchicago30
from .socfbwilliams40 import SocfbWilliams40
from .actor import Actor
from .socfbbrown11 import SocfbBrown11
from .t520 import T520
from .tf18 import Tf18
from .biocelc import BioCeLc
from .sw10030d3trial1 import Sw10030d3Trial1
from .t60k import T60k
from .bcsstk33 import Bcsstk33
from .crack import Crack
from .cl100002d0trial3 import Cl100002d0Trial3
from .socfbsanta74 import SocfbSanta74
from .socfbcornell5 import SocfbCornell5
from .air04 import Air04
from .petsterfriendshipsdog import PetsterFriendshipsDog
from .sw1000060d2trial1 import Sw1000060d2Trial1
from .biogridfissionyeast import BioGridFissionYeast
from .sw10040d2trial1 import Sw10040d2Trial1
from .pct20stif import Pct20stif
from .comyoutube import ComYoutube
from .petsterfriendshipscat import PetsterFriendshipsCat
from .socfbharvard1 import SocfbHarvard1
from .hugetrace00000 import Hugetrace00000
from .brock4003 import Brock4003
from .polblogs import Polblogs
from .hugetrace00010 import Hugetrace00010
from .cl10001d9trial3 import Cl10001d9Trial3
from .roget import Roget
from .g14 import G14
from .webpolblogs import WebPolblogs
from .arenaspgp import ArenasPgp
from .netscience import Netscience
from .socfbvirginia63 import SocfbVirginia63
from .plc6030l2 import Plc6030L2
from .gene import Gene
from .foodwebbaywet import FoodwebBaywet
from .g22 import G22
from .indochina2004 import Indochina2004
from .bcspwr01 import Bcspwr01
from .biogridhuman import BioGridHuman
from .coauthorsciteseer import Coauthorsciteseer
from .socblogcatalog import SocBlogcatalog
from .biosccc import BioScCc
from .socfoursquare import SocFoursquare
from .bcsstm22 import Bcsstm22
from .qa8fm import Qa8fm
from .socfbwellesley22 import SocfbWellesley22
from .halfb import Halfb
from .comamazon import ComAmazon
from .roadroadusa import RoadRoadUsa
from .socfbuconn import SocfbUconn
from .emailenrononly import EmailEnronOnly
from .ucidatagama import UcidataGama
from .dd68 import Dd68
from .sw10050d1trial3 import Sw10050d1Trial3
from .socfbuga50 import SocfbUga50
from .pkustk06 import Pkustk06
from .cl1000001d9trial1 import Cl1000001d9Trial1
from .sw10050d2trial2 import Sw10050d2Trial2
from .socyoutube import SocYoutube
from .stufe10 import Stufe10
from .sw100060d1trial2 import Sw100060d1Trial2
from .cl10000002d0trial3 import Cl10000002d0Trial3
from .sphere2 import Sphere2
from .enzymes118 import Enzymes118
from .socfbindiana import SocfbIndiana
from .opt1 import Opt1
from .g40 import G40
from .sw100060d2trial3 import Sw100060d2Trial3
from .g50 import G50
from .econpsmigr2 import EconPsmigr2
from .sw100050d3trial2 import Sw100050d3Trial2
from .socfbmit8 import SocfbMit8
from .p2pgnutella04 import P2pGnutella04
from .dblpauthor import DblpAuthor
from .citationciteseer import Citationciteseer
from .cl10001d7trial1 import Cl10001d7Trial1
from .sw10060d3trial3 import Sw10060d3Trial3
from .sw1000040d3trial3 import Sw1000040d3Trial3
from .infopenflights import InfOpenflights
from .nr08blocks import NR08blocks
from .ig513 import Ig513
from .channel500x100x100b050 import Channel500x100x100B050
from .techascaida2007 import TechAsCaida2007
from .sw1000030d2trial3 import Sw1000030d2Trial3
from .twitter import Twitter
from .johnson824 import Johnson824
from .cl10000001d8trial3 import Cl10000001d8Trial3
from .sw1000030d1trial2 import Sw1000030d1Trial2
from .copter1 import Copter1
from .phat15001 import PHat15001
from .tf11 import Tf11
from .dixmaanl import Dixmaanl
from .biohumangene2 import BioHumanGene2
from .fsfa import FsFa
from .cl1000002d1trial1 import Cl1000002d1Trial1
from .wave import Wave
from .gupta3 import Gupta3
from .jgl011 import Jgl011
from .dd242 import Dd242
from .fesphere import FeSphere
from .bcsstm08 import Bcsstm08
from .socfbnipsego import SocfbNipsEgo
from .net41 import Net41
from .techarenasjazz import TechArenasJazz
from .cl10001d8trial3 import Cl10001d8Trial3
from .socfbvermont70 import SocfbVermont70
from .socdigg import SocDigg
from .sw10040d3trial1 import Sw10040d3Trial1
from .uk2005 import Uk2005
from .infpower import InfPower
from .sw1000060d3trial1 import Sw1000060d3Trial1
from .webuk2005all import WebUk2005All
from .lock1074 import Lock1074
from .petsterfriendshipshamster import PetsterFriendshipsHamster
from .socfbrutgers89 import SocfbRutgers89
from .cl100002d1trial3 import Cl100002d1Trial3
from .roadasiaosm import RoadAsiaOsm
from .sw10030d2trial1 import Sw10030d2Trial1
from .cfat50010 import CFat50010
from .brock2002 import Brock2002
from .tf14 import Tf14
from .rajat06 import Rajat06
from .ig516 import Ig516
from .as22july06 import As22july06
from .cfat2005 import CFat2005
from .webkbwisc import WebkbWisc
from .cl10000001d7trial1 import Cl10000001d7Trial1
from .socfbucsc68 import SocfbUcsc68
from .shock9 import Shock9
from .san200091 import San200091
from .condmat import CondMat
from .cities import Cities
from .rail4284 import Rail4284
from .socfbyale4 import SocfbYale4
from .lshp3466 import Lshp3466
from .s4dkt3m2 import S4dkt3m2
from .debr import Debr
from .bcspwr04 import Bcspwr04
from .g37 import G37
from .g27 import G27
from .sw100030d3trial1 import Sw100030d3Trial1
from .maayanstelzl import MaayanStelzl
from .struct4 import Struct4
from .socfbmich67 import SocfbMich67
from .cl10002d0trial3 import Cl10002d0Trial3
from .kleemin import Kleemin
from .jagmesh9 import Jagmesh9
from .lp1 import Lp1
from .trec7 import Trec7
from .phat7003 import PHat7003
from .affwikienarticlecat import AffWikiEnArticleCat
from .cage4 import Cage4
from .sw1000050d1trial1 import Sw1000050d1Trial1
from .socfbuf import SocfbUf
from .erdos971 import Erdos971
from .pkustk03 import Pkustk03
from .pkustk13 import Pkustk13
from .scnasasrb import ScNasasrb
from .g55 import G55
from .g45 import G45
from .california import California
from .roadluxembourgosm import RoadLuxembourgOsm
from .cl100001d9trial3 import Cl100001d9Trial3
from .sw100040d2trial1 import Sw100040d2Trial1
from .cacsphd import CaCsphd
from .ucidatazachary import UcidataZachary
from .cl1000002d0trial1 import Cl1000002d0Trial1
from .socphysicians import SocPhysicians
from .soclivejournal1 import SocLivejournal1
from .crystm02 import Crystm02
from .g63 import G63
from .nr130bit import NR130bit
from .socfbgwu54 import SocfbGwu54
from .dblp2010 import Dblp2010
from .hamming64 import Hamming64
from .amazon0601 import Amazon0601
from .soclocbrightkite import SocLocBrightkite
from .emailenronlarge import EmailEnronLarge
from .c40005 import C40005
from .sw1000030d3trial3 import Sw1000030d3Trial3
from .socthemarker import SocThemarker
from .infusair97 import InfUsair97
from .roadroadnetpa import RoadRoadnetPa
from .pli import Pli
from .maayanvidal import MaayanVidal
from .socfbucla import SocfbUcla
from .soctribes import SocTribes
from .cl10000001d9trial3 import Cl10000001d9Trial3
from .socfbauburn71 import SocfbAuburn71
from .webbase1m import Webbase1m
from .amazon0505 import Amazon0505
from .sw1000040d2trial3 import Sw1000040d2Trial3
from .p2pgnutella08 import P2pGnutella08
from .sw10060d2trial3 import Sw10060d2Trial3
from .bcsstm11 import Bcsstm11
from .copapersdblp import CoPapersDblp
from .sfhhconfsensor import SfhhConfSensor
from .sw1000040d1trial2 import Sw1000040d1Trial2
from .cage13 import Cage13
from .enzymes296 import Enzymes296
from .sw10060d1trial2 import Sw10060d1Trial2
from .epinions import Epinions
from .ig56 import Ig56
from .rgg010 import Rgg010
from .socfbtennessee95 import SocfbTennessee95
from .sw100050d2trial2 import Sw100050d2Trial2
from .coater1 import Coater1
from .sw100050d1trial3 import Sw100050d1Trial3
from .flickrgroupmemberships import FlickrGroupmemberships
from .cl10000002d1trial3 import Cl10000002d1Trial3
from .lesmis import Lesmis
from .socepinions import SocEpinions
from .g3rmt3m3 import G3rmt3m3
from .infectdublin import InfectDublin
from .sw100060d3trial3 import Sw100060d3Trial3
from .feocean import FeOcean
from .gen200p0955 import Gen200P0955
from .g3 import G3
from .usair97 import Usair97
from .c2509 import C2509
from .cl100001d7trial1 import Cl100001d7Trial1
from .socfbtemple83 import SocfbTemple83
from .sanr40005 import Sanr40005
from .lederberg import Lederberg
from .lshp1882 import Lshp1882
from .lock2232 import Lock2232
from .webhudong import WebHudong
from .cl1000001d8trial1 import Cl1000001d8Trial1
from .sw10050d3trial2 import Sw10050d3Trial2
from .internet import Internet
from .dbpediaproducer import DbpediaProducer
from .sochamsterster import SocHamsterster
from .net125 import Net125
from .socfbuciuni import SocfbUciUni
from .coauthorsdblp import Coauthorsdblp
from .keller6 import Keller6
from .fbmessages import FbMessages
from .socfbvassar85 import SocfbVassar85
from .socanybeat import SocAnybeat
from .brack2 import Brack2
from .socfbtrinity100 import SocfbTrinity100
from .aa4 import Aa4
from .rthiggs import RtHiggs
from .ex1 import Ex1
from .sw1000030d3trial2 import Sw1000030d3Trial2
from .socslashdotzoo import SocSlashdotZoo
from .san400091 import San400091
from .phat5001 import PHat5001
from .socfbprinceton12 import SocfbPrinceton12
from .cl10000001d9trial2 import Cl10000001d9Trial2
from .contiguoususa import ContiguousUsa
from .cegb3024 import Cegb3024
from .citpatents import CitPatents
from .biocegn import BioCeGn
from .san1000 import San1000
from .socfbaanon import SocfbAAnon
from .lshp2614 import Lshp2614
from .g62 import G62
from .crystm03 import Crystm03
from .socfbsyracuse56 import SocfbSyracuse56
from .sw100050d2trial3 import Sw100050d2Trial3
from .g10 import G10
from .divorce import Divorce
from .roadchesapeake import RoadChesapeake
from .curtis54 import Curtis54
from .ig57 import Ig57
from .flickredges import Flickredges
from .sw100050d1trial2 import Sw100050d1Trial2
from .socslashdot0811 import SocSlashdot0811
from .linux import Linux
from .sw10060d2trial2 import Sw10060d2Trial2
from .p2pgnutella09 import P2pGnutella09
from .sw1000040d2trial2 import Sw1000040d2Trial2
from .sw10060d1trial3 import Sw10060d1Trial3
from .enzymes297 import Enzymes297
from .cage12 import Cage12
from .afforkutuser2groups import AffOrkutUser2groups
from .sw1000040d1trial3 import Sw1000040d1Trial3
from .bnmouseretina import BNMouseRetina
from .livejournalgroupmemberships import LivejournalGroupmemberships
from .webit2004 import WebIt2004
from .socfbuc64 import SocfbUc64
from .g2 import G2
from .biodmcx import BioDmCx
from .sw10050d3trial3 import Sw10050d3Trial3
from .cadblp2010 import CaDblp2010
from .socfbpepperdine86 import SocfbPepperdine86
from .wikiencat import WikiEnCat
from .reuters911 import Reuters911
from .cl10000002d1trial2 import Cl10000002d1Trial2
from .webwikichinternal import WebWikiChInternal
from .hamming102 import Hamming102
from .crew1 import Crew1
from .eris1176 import Eris1176
from .socfbucsb37 import SocfbUcsb37
from .bnflydrosophilamedulla import BNFlyDrosophilaMedulla
from .sw100060d3trial2 import Sw100060d3Trial2
from .gen200p0944 import Gen200P0944
from .oregon1 import Oregon1
from .ins2 import Ins2
from .sk2005 import Sk2005
from .aa5 import Aa5
from .jagmesh1 import Jagmesh1
from .socgowalla import SocGowalla
from .tomographic1 import Tomographic1
from .jazz import Jazz
from .caimdb import CaImdb
from .lshp3025 import Lshp3025
from .dd687 import Dd687
from .infcontiguoususa import InfContiguousUsa
from .nw14 import Nw14
from .arenasjazz import ArenasJazz
from .cyl6 import Cyl6
from .scimet import Scimet
from .socfbsmith60 import SocfbSmith60
from .gen400p0955 import Gen400P0955
from .roadusroads48 import RoadUsroads48
from .bcsstm19 import Bcsstm19
from .net50 import Net50
from .bcsstm09 import Bcsstm09
from .m14b import M14b
from .mip1 import Mip1
from .ford1 import Ford1
from .dd21 import Dd21
from .biodmela import BioDmela
from .smagri import Smagri
from .cl10001d8trial2 import Cl10001d8Trial2
from .harvard500 import Harvard500
from .gent113 import Gent113
from .dd349 import Dd349
from .aa03 import Aa03
from .techas22july06 import TechAs22july06
from .sanr20007 import Sanr20007
from .brock2003 import Brock2003
from .enzymes123 import Enzymes123
from .tf15 import Tf15
from .biosclc import BioScLc
from .socslashdot0902 import SocSlashdot0902
from .cl100002d1trial2 import Cl100002d1Trial2
from .wing import Wing
from .sw10030d1trial1 import Sw10030d1Trial1
from .nr192bit import NR192bit
from .ig517 import Ig517
from .rajat07 import Rajat07
from .eu2005 import Eu2005
from .jagmesh8 import Jagmesh8
from .brock8001 import Brock8001
from .erdos02 import Erdos02
from .copapersciteseer import CoPapersCiteseer
from .cl10002d0trial2 import Cl10002d0Trial2
from .bcsstm26 import Bcsstm26
from .trec6 import Trec6
from .techasskitter import TechAsSkitter
from .webarabic2005 import WebArabic2005
from .citdblp import CitDblp
from .wikitalk import WikiTalk
from .lshp1009 import Lshp1009
from .socfblehigh96 import SocfbLehigh96
from .affdbpediausers2country import AffDbpediaUsers2country
from .socfbtulane29 import SocfbTulane29
from .manna45 import MannA45
from .g26 import G26
from .nr598a import NR598a
from .dbpediaall import DbpediaAll
from .bcspwr05 import Bcspwr05
from .cegb3306 import Cegb3306
from .g36 import G36
from .pf2177 import Pf2177
from .manna27 import MannA27
from .soclivejournal07 import SocLivejournal07
from .socfbgeorgetown15 import SocfbGeorgetown15
from .sw100040d1trial1 import Sw100040d1Trial1
from .g44 import G44
from .g54 import G54
from .odlis import Odlis
from .cl100001d9trial2 import Cl100001d9Trial2
from .cage5 import Cage5
from .phat7002 import PHat7002
from .dbpediastarring import DbpediaStarring
from .sw1000050d2trial1 import Sw1000050d2Trial1
from .webspam import WebSpam
from .pkustk12 import Pkustk12
from .webbaidubaike import WebBaiduBaike
from .pkustk02 import Pkustk02
from .webclueweb09 import WebClueweb09
from .webcc12payleveldomain import WebCc12Payleveldomain
from .socfbbingham82 import SocfbBingham82
from .bioyeast import BioYeast
from .citeulikeui import CiteulikeUi
from .citeuliketi import CiteulikeTi
from .lpl1 import Lpl1
from .bioscgt import BioScGt
from .sw100050d2trial1 import Sw100050d2Trial1
from .coater2 import Coater2
from .copresencelyonschool import CopresenceLyonschool
from .cage10 import Cage10
from .sw1000040d1trial1 import Sw1000040d1Trial1
from .enzymes295 import Enzymes295
from .sw10060d1trial1 import Sw10060d1Trial1
from .cahepph import CaHepph
from .webwebbase2001all import WebWebbase2001All
from .bcsstm02 import Bcsstm02
from .nr176bit import NR176bit
from .emailenron import EmailEnron
from .phat5003 import PHat5003
from .primaryschoolproximity import PrimarySchoolProximity
from .socfbwilliam77 import SocfbWilliam77
from .air02 import Air02
from .socfbumass92 import SocfbUmass92
from .minnesota import Minnesota
from .smallw import Smallw
from .crystm01 import Crystm01
from .opsahlopenflights import OpsahlOpenflights
from .g60 import G60
from .friendster import Friendster
from .livejournallinks import LivejournalLinks
from .soccatster import SocCatster
from .l import L
from .cl1000002d0trial2 import Cl1000002d0Trial2
from .livejournal import Livejournal
from .p2pgnutella24 import P2pGnutella24
from .ex2 import Ex2
from .t03314l import T03314l
from .enron import Enron
from .jagmesh3 import Jagmesh3
from .socfbmississippi66 import SocfbMississippi66
from .keller5 import Keller5
from .csphd import Csphd
from .biogridyeast import BioGridYeast
from .techip import TechIp
from .c1259 import C1259
from .socfbmiddlebury45 import SocfbMiddlebury45
from .soclivemocha import SocLivemocha
from .trec14 import Trec14
from .infecthyper import InfectHyper
from .nr144 import NR144
from .cl1000001d8trial2 import Cl1000001d8Trial2
from .sw10050d3trial1 import Sw10050d3Trial1
from .cadblp2012 import CaDblp2012
from .copresencelh10 import CopresenceLh10
from .ash219 import Ash219
from .cl100001d7trial2 import Cl100001d7Trial2
from .socwikitalkdir import SocWikiTalkDir
from .l9 import L9
from .dbpedia import Dbpedia
from .pkustk09 import Pkustk09
from .caopsahlcollaboration import CaOpsahlCollaboration
from .crplat2 import Crplat2
from .dd6 import Dd6
from .eat import Eat
from .emaildnccorecipient import EmailDncCorecipient
from .aa01 import Aa01
from .adaptive import Adaptive
from .cl10000001d7trial2 import Cl10000001d7Trial2
from .biohsht import BioHsHt
from .roadbelgiumosm import RoadBelgiumOsm
from .ig515 import Ig515
from .caciteseer import CaCiteseer
from .sw10030d1trial3 import Sw10030d1Trial3
from .socblogcatalogasu import SocBlogcatalogAsu
from .comdblp import ComDblp
from .sw10030d2trial2 import Sw10030d2Trial2
from .tf17 import Tf17
from .brock2001 import Brock2001
from .net100 import Net100
from .san400051 import San400051
from .rw5151 import Rw5151
from .egofacebook import EgoFacebook
from .socfbswarthmore42 import SocfbSwarthmore42
from .sw10040d3trial2 import Sw10040d3Trial2
from .webbaidubaikerelated import WebBaiduBaikeRelated
from .socorkutdir import SocOrkutDir
from .sw1000060d3trial2 import Sw1000060d3Trial2
from .webgoogle import WebGoogle
from .flickrlinks import FlickrLinks
from .biogridplant import BioGridPlant
from .ukerbe1 import Ukerbe1
from .socfbucsd34 import SocfbUcsd34
from .cithepth2007 import CitHepth2007
from .alemdar import Alemdar
from .socyoutubesnap import SocYoutubeSnap
from .ragusa18 import Ragusa18
from .biowormnetv3benchmark import BioWormnetV3Benchmark
from .condmat2003 import CondMat2003
from .socfbwashu32 import SocfbWashu32
from .websk2005all import WebSk2005All
from .sw100040d2trial2 import Sw100040d2Trial2
from .c20005 import C20005
from .socfriendster import SocFriendster
from .bioceht import BioCeHt
from .socfbuconn91 import SocfbUconn91
from .g56 import G56
from .trdheim import Trdheim
from .g9 import G9
from .g46 import G46
from .sw100040d1trial3 import Sw100040d1Trial3
from .nr12month1 import NR12month1
from .farm import Farm
from .usroads import Usroads
from .erdos972 import Erdos972
from .hepthnew import HepThNew
from .cegb2919 import Cegb2919
from .biodiseasome import BioDiseasome
from .orkutgroupmemberships import OrkutGroupmemberships
from .sw1000050d2trial3 import Sw1000050d2Trial3
from .pkustk10 import Pkustk10
from .airfoil1 import Airfoil1
from .webit2004all import WebIt2004All
from .sw1000050d1trial2 import Sw1000050d1Trial2
from .cage7 import Cage7
from .techrlcaida import TechRlCaida
from .webberkstan import WebBerkstan
from .blckhole import Blckhole
from .bcsstm24 import Bcsstm24
from .trec4 import Trec4
from .cora import Cora
from .brock8003 import Brock8003
from .socfbsimmons81 import SocfbSimmons81
from .venturilevel3 import Venturilevel3
from .biodrcx import BioDrCx
from .iptrace import IpTrace
from .hugetrace00020 import Hugetrace00020
from .socfbcaltech36 import SocfbCaltech36
from .bcspwr07 import Bcspwr07
from .soctwitterhiggs import SocTwitterHiggs
from .sw100030d3trial2 import Sw100030d3Trial2
from .socfbbanon import SocfbBAnon
from .g24 import G24
from .cfindergoogle import CfinderGoogle
from .socfbwesleyan43 import SocfbWesleyan43
from .san200092 import San200092
from .roadroadnetca import RoadRoadnetCa
from .biomousegene import BioMouseGene
from .sw10030d1trial2 import Sw10030d1Trial2
from .ig514 import Ig514
from .tf16 import Tf16
from .fullb import Fullb
from .sw10030d2trial3 import Sw10030d2Trial3
from .copresenceinvs13 import CopresenceInvs13
from .cl100002d1trial1 import Cl100002d1Trial1
from .socfbbrandeis99 import SocfbBrandeis99
from .biodmlc import BioDmLc
from .sls import Sls
from .johnson1624 import Johnson1624
from .citeulikeut import CiteulikeUt
from .cl10000001d7trial3 import Cl10000001d7Trial3
from .amazon2008 import Amazon2008
from .socfbtexas84 import SocfbTexas84
from .dbpediawriter import DbpediaWriter
from .nr3dtube import NR3dtube
from .rw136 import Rw136
from .cl10001d8trial1 import Cl10001d8Trial1
from .cage import Cage
from .hospitalwardproximity import HospitalWardProximity
from .socfbdartmouth6 import SocfbDartmouth6
from .ford2 import Ford2
from .techas735 import TechAs735
from .maayanpdzbase import MaayanPdzbase
from .maayanfoodweb import MaayanFoodweb
from .sw1000060d3trial3 import Sw1000060d3Trial3
from .socfbuc33 import SocfbUc33
from .sw10040d3trial3 import Sw10040d3Trial3
from .misclesmis import MiscLesmis
from .biocelegansneural import BioCelegansneural
from .orkut import Orkut
from .pkustk11 import Pkustk11
from .sw1000050d2trial2 import Sw1000050d2Trial2
from .pkustk01 import Pkustk01
from .cti import Cti
from .cage6 import Cage6
from .soctwitter2010 import SocTwitter2010
from .sw1000050d1trial3 import Sw1000050d1Trial3
from .techroutersrf import TechRoutersRf
from .scpwtk import ScPwtk
from .phat7001 import PHat7001
from .power import Power
from .citeseer import Citeseer
from .sw100040d2trial3 import Sw100040d2Trial3
from .cl100001d9trial1 import Cl100001d9Trial1
from .g47 import G47
from .aveswildbirdnetwork import AvesWildbirdNetwork
from .sw100040d1trial2 import Sw100040d1Trial2
from .g8 import G8
from .g25 import G25
from .sw100030d3trial3 import Sw100030d3Trial3
from .wikisignedk2 import WikisignedK2
from .socljournal2008 import SocLjournal2008
from .g35 import G35
from .bcspwr06 import Bcspwr06
from .copresencesfhh import CopresenceSfhh
from .dbpedialink import DbpediaLink
from .auto import Auto
from .san200093 import San200093
from .hugetric00020 import Hugetric00020
from .trec5 import Trec5
from .socfbvanderbilt48 import SocfbVanderbilt48
from .bcsstm25 import Bcsstm25
from .nr162bit import NR162bit
from .socfbemory27 import SocfbEmory27
from .socfbucf52 import SocfbUcf52
from .socfbcal65 import SocfbCal65
from .odepb400 import Odepb400
from .techarenaspgp import TechArenasPgp
from .biocelegansdir import BioCelegansDir
from .cl10002d0trial1 import Cl10002d0Trial1
from .brock8002 import Brock8002
from .cegb2802 import Cegb2802
from .socflixster import SocFlixster
from .socfbrice31 import SocfbRice31
from .ash85 import Ash85
from .socfbpenn94 import SocfbPenn94
from .cage11 import Cage11
from .fa import Fa
from .sw10060d2trial1 import Sw10060d2Trial1
from .sw1000040d2trial1 import Sw1000040d2Trial1
from .gottronexcellent import GottronExcellent
from .sw100050d1trial1 import Sw100050d1Trial1
from .socwikivote import SocWikiVote
from .visualizeus import VisualizeUs
from .pgpgiantcompo import Pgpgiantcompo
from .socbrightkite import SocBrightkite
from .ecomangwet import EcoMangwet
from .sockarate import SocKarate
from .m3plates import M3plates
from .brock4004 import Brock4004
from .soclivejournalusergroups import SocLivejournalUserGroups
from .socstudentcoop import SocStudentCoop
from .g61 import G61
from .wbedu import WbEdu
from .cl1000002d0trial3 import Cl1000002d0Trial3
from .petsterhamster import PetsterHamster
from .screl9 import ScRel9
from .phat5002 import PHat5002
from .stufe import Stufe
from .cl10000001d9trial1 import Cl10000001d9Trial1
from .polbooks import Polbooks
from .ramage02 import Ramage02
from .socflickrasu import SocFlickrAsu
from .sw1000030d3trial1 import Sw1000030d3Trial1
from .cahollywood2009 import CaHollywood2009
from .webnotredame import WebNotredame
from .camathscinet import CaMathscinet
from .imdb import IMDB
from .air03 import Air03
from .webwebbase2001 import WebWebbase2001
from .bnmacaquerhesusbrain import BNMacaqueRhesusBrain
from .lasagnespanishbook import LasagneSpanishbook
from .keller4 import Keller4
from .proteinsall import ProteinsAll
from .cfat5005 import CFat5005
from .scmsdoor import ScMsdoor
from .techwhois import TechWhois
from .lop163 import Lop163
from .net75 import Net75
from .adjnoun import Adjnoun
from .p2pgnutella25 import P2pGnutella25
from .socfbvillanova62 import SocfbVillanova62
from .sw1000060d3l5 import Sw1000060d3L5
from .astroph import AstroPh
from .jagmesh2 import Jagmesh2
from .aa6 import Aa6
from .celegansneural import Celegansneural
from .hamming82 import Hamming82
from .powereris1176 import PowerEris1176
from .webclueweb0950m import WebClueweb0950m
from .pkustk08 import Pkustk08
from .sw100060d3trial1 import Sw100060d3Trial1
from .oregon2 import Oregon2
from .socflickr import SocFlickr
from .egotwitter import EgoTwitter
from .fcondp2 import Fcondp2
from .biogridmouse import BioGridMouse
from .cl10000002d1trial1 import Cl10000002d1Trial1
from .kl02 import Kl02
from .socfbuillinois import SocfbUillinois
from .socfbucla26 import SocfbUcla26
from .socfbjmu79 import SocfbJmu79
from .df2177 import Df2177
from .webuk2002all import WebUk2002All
from .uk import Uk
from .cl1000001d8trial3 import Cl1000001d8Trial3
from .socfbamherst41 import SocfbAmherst41
from .socflickrund import SocFlickrUnd
from .socfbhaverford76 import SocfbHaverford76
from .libimseti import Libimseti
from .cl100001d7trial3 import Cl100001d7Trial3
from .sanr40007 import Sanr40007
from .scshipsec5 import ScShipsec5
from .socfbrochester38 import SocfbRochester38
from .g1 import G1

__all__ = [
	"C5009", "OpsahlSouthernwomen", "SocfbNorthwestern25", "Gen400P0965", "Gen400P0975",
	"San400073", "G29", "Cl10002d1Trial1", "G39", "SocfbUsc35", "Jagmesh7",
	"Aa3", "ZhishiZhwikiInternallink", "Sw100030d2Trial3", "TechAsCaida", "ScLdoor",
	"Trec9", "SocfbBowdoin47", "Bcsstm39", "Dsjc5005", "P2pGnutella30", "Tube2",
	"Email", "NR208bit", "Ex6", "Sw100030d1Trial2", "Sw100040d3Trial3", "Cl100001d8Trial1",
	"MannA9", "Hamming104", "BioScHt", "InfEuroroad", "Cl1000001d7Trial1",
	"MannA81", "Tsyl201", "G4", "Sw1000050d3Trial2", "YahooMsg", "Skirt", "Net150",
	"DbpediaTeam", "PowerBcspwr09", "Dictionary28", "Trec10", "Barth5", "Foldoc",
	"Sw10040d1Trial2", "Bcsstm06", "Sw1000060d1Trial2", "Sw10040d2Trial3",
	"EcoStmarks", "Sw1000060d2Trial3", "Patentcite", "Johnson3224", "EmailEuall",
	"SocSinaweibo", "Cage14", "G16", "Cl10001d9Trial1", "ActorCollaboration",
	"Kohonen", "SocHighschoolMoreno", "Biplane9", "Brock4001", "Plc4030L5",
	"SocfbMsu24", "SocfbJohnshopkins55", "Ljournal2008", "Ig518", "G64", "Rajat08",
	"Finance256", "SocLivejournal", "Air06", "Cl100002d0Trial1", "FeBody",
	"Bcsstk31", "SocAnuResidence", "Engine", "Sw10030d3Trial3", "Cage3", "CaHepth",
	"FoodwebBaydry", "SocfbOberlin44", "SocTwitter", "Cl1000001d9Trial3", "MiscImdbBi",
	"Pkustk04", "Pkustk14", "BNHumanJung", "Sw10050d1Trial1", "BioScTs", "G52",
	"Sw100060d2Trial1", "DbpediaRecordlabel", "G42", "PowerBcspwr10", "Cl10000002d0Trial1",
	"SocfbMaryland58", "Rw496", "Se", "Cl10k1d8L5", "RoadnetPa", "Bcspwr03",
	"SocDelicious", "G30", "RoadNetherlandsOsm", "Dolphins", "InfRoadnetPa",
	"SocfbBc17", "Pcrystk03", "Struct3", "TechArenasMeta", "Bcsstm20", "Patents",
	"AffFlickrUserGroups", "Ash958", "PHat15003", "Tf13", "Cl10000001d8Trial1",
	"SocfbHoward90", "Enzymes8", "CFat2002", "Rajat01", "Sw1000030d2Trial1",
	"Pds10", "SocDolphins", "Ig511", "Lshp1561", "Ash292", "SocfbAmerican75",
	"SocfbMit", "Gupta1", "SocfbHamilton46", "San200072", "Dsjc10005", "Cl1000002d1Trial3",
	"P2pGnutella06", "Packing500x100x100B050", "BioCeGt", "ActorMovie", "MiscJungCodeDep",
	"PHat3003", "SocSlashdot", "Data", "Ash331", "Uk2002", "Erdos992", "Erdos982",
	"Ig58", "PHat10002", "Uspowergrid", "AffGithubUser2project", "RtRetweet",
	"CopresenceThiers13", "Chesapeake", "Sstmodel", "Sw1000040d3Trial1", "Johnson844",
	"Sw10060d3Trial1", "Cl10001d7Trial3", "AffAmazonCopurchases", "CaMathscinetDir",
	"G43", "G53", "AffDigg", "Sw100060d1Trial1", "CaCondmat", "DblpCite", "Cl1000001d9Trial2",
	"Sw10050d2Trial1", "Amazon0302", "Amazon0312", "TechP2pGnutella", "FbCmuCarnegie49",
	"BioCeCx", "Barth", "Pkustk05", "Srb1", "WebIndochina2004All", "Pcrystk02",
	"SocSlashdotTrustAll", "MaayanFigeys", "BioCelegans", "As735", "Bcsstm21",
	"AsSkitter", "Hollywood2009", "CaErdos992", "Dd497", "ArenasMeta", "SocfbFsu53",
	"CaNetscience", "SocTwitterFollows", "AvesSparrowSocial", "SocfbCmu", "ScPkustk11",
	"WebEpa", "Bcspwr02", "G31", "Chem97zt", "TechInternetAs", "SocfbWake73",
	"ZhishiBaiduInternallink", "Bfly", "AvesWeaverSocial", "DbpediaCountry",
	"Net25", "BioHumanGene1", "Cl1000002d1Trial2", "ZhishiHudongInternallink",
	"Bcsstk29", "BioCePg", "SocPokec", "Us04", "Sw1000030d1Trial1", "Copter2",
	"SocfbMichigan23", "Brock2004", "Tf12", "PHat15002", "YoutubeGroupmemberships",
	"Connectus", "Ig510", "RoadGermanyOsm", "Rajat10", "BioHsCx", "EcoFoodwebBaywet",
	"Bas1lp", "Ig59", "RtRetweetCrawl", "SocfbWisconsin87", "Glossgt", "Cl10001d7Trial2",
	"SocGooglePlus", "PHat10003", "Lshp2233", "Pfinan512", "MaayanFaa", "RoadnetTx",
	"Sw100050d3Trial1", "CaAminer", "SocfbTexas80", "Sw100030d2Trial2", "ZhishiBaiduRelatedpages",
	"WbCsStanford", "Jagmesh6", "Sw100030d1Trial3", "P2pGnutella31", "Reactome",
	"Github", "SocfbBerkeley13", "ZhishiHudongRelatedpages", "Trec8", "San400072",
	"WebItalycnr2000", "WebStanford", "WebIndochina2004", "SocfbNortheastern19",
	"Stanford", "CFat5001", "SocSignBitcoinotc", "Flickr", "G38", "Sw1000050d3Trial3",
	"G5", "ScShipsec1", "SocfbColgate88", "Arabic2005", "Ccc", "Barth4", "C20009",
	"SocLastfm", "Trec11", "SocBuzznet", "Usroads48", "BioGridWorm", "Sw100040d3Trial2",
	"SocfbNotredame57", "Epa", "ErMd", "G17", "SocfbIndiana69", "Cvxbqp1",
	"Sw1000060d1Trial3", "Hugebubbles00010", "Sw10040d1Trial3", "Hugebubbles00000",
	"SocfbColumbia2", "Cage15", "Sw1000060d2Trial2", "RoadUsroads", "SocAcademia",
	"Sw10040d2Trial2", "Karate", "Sw10030d3Trial2", "Sanr20009", "Bcsstk30",
	"Cl10m1d8L5", "WordnetWords", "MiscFootball", "EgoGplus", "SocfbUnc28",
	"WebEdu", "CaGrqc", "BioWormnetV3", "Mri1", "Rajat09", "G65", "Grid1",
	"Hamming62", "Gearbox", "Bcsstm23", "TechAsCaida20071105", "WebBerkstanDir",
	"SocPokecRelationships", "SocAdvogato", "RoadGreatBritainOsm", "Brock8004",
	"SocfbStanford3", "RoadMinnesota", "WebSpamDetection", "Bcspwr10", "G23",
	"ScPkustk13", "Chem97ztz", "EcoEverglades", "SocfbKonect", "YoutubeLinks",
	"Sphere3", "EmailUniv", "AsCaida20071105", "Cl10000002d0Trial2", "Sw100060d1Trial3",
	"Lshp1270", "G51", "Sw100060d2Trial2", "PetsterCarnivore", "G41", "Pkustk07",
	"Sw10050d1Trial2", "DbpediaOccupation", "SocfbMaine59", "SocfbUillinois20",
	"SocfbCarnegie49", "TechP2p", "Sw10050d2Trial3", "Football", "PHat10001",
	"Sw1000040d3Trial2", "C10009", "Sw10060d3Trial2", "Erdos991", "Dd199",
	"WebWikipedia2009", "Erdos981", "WebUk2005", "SocfbBaylor93", "Fe4elt2",
	"Abb313", "TrecWt10g", "SocfbReed98", "Sw100050d3Trial3", "SocfbNyu9",
	"P2pGnutella05", "EcoFoodwebBaydry", "Gupta2", "San200071", "Advogato",
	"SocfbBu10", "CaCoauthorsDblp", "CFat2001", "RtTwitterCopen", "RoadItalyOsm",
	"BioGridFruitfly", "SocfbDuke14", "Sw1000030d2Trial2", "Rajat02", "Ig512",
	"OpsahlUsairport", "SocfbUsf51", "SocGplus", "Tf10", "Troll", "Cl10000001d8Trial2",
	"TechPgp", "Sw1000030d1Trial3", "CopresenceInvs15", "Trec13", "WebGoogleDir",
	"AsCaida", "Cca", "FeTooth", "Sw1000050d3Trial1", "G7", "G48", "SocfbOr",
	"SocfbUc61", "G58", "CaAstroph", "Cl1000001d7Trial2", "BioDmHt", "SocfbUpenn7",
	"EmailEu", "EcoFlorida", "Cage9", "Cl100001d8Trial2", "DbpediaGenre", "Tube1",
	"Ex5", "Sw100030d1Trial1", "Jagmesh4", "NR145bit", "Journals", "Hamming84",
	"HepTh", "Lock3491", "Eva", "Cl10002d1Trial2", "Geom", "Bcspwr09", "SocfbTufts18",
	"SocTwitterMpiSws", "SocTwitterFollowsMun", "SocfbMu78", "Cl100002d0Trial2",
	"Bcsstk32", "RoadnetCa", "AffWikiWordbypage", "As20000102", "Cnr2000",
	"InfRoadnetCa", "Jgl009", "Air05", "Rail2586", "Pwt", "SocEpinions1", "G67",
	"Tf19", "Pattern1", "SocfbUva16", "Nasa4704", "TechCaidarouterlevel", "Cs4",
	"Ash608", "Hugetric00000", "Hugetric00010", "BioYeastProteinInter", "SocFirmHiTech",
	"G15", "SocOrkut", "MiscReuters911", "Cl10001d9Trial2", "In2004", "Brock4002",
	"Netz4504", "PowerUsGrid", "RoadEuroroad", "Bcsstm05", "Ragusa16", "OpsahlPowergrid",
	"SocfbUsfca72", "Sw10040d1Trial1", "SocfbOklahoma97", "Sw1000060d1Trial1",
	"SocDouban", "SocfbBucknell39", "Cl1000001d7Trial3", "CaActorCollaboration",
	"NR3elt", "WebSk2005", "Cl100001d8Trial3", "Sw100040d3Trial1", "Cage8",
	"CitPatent", "BioHsLc", "Trec12", "Caidarouterlevel", "DbpediaLocation",
	"G59", "G49", "G6", "It2004", "CFat5002", "Bcspwr08", "Cl10002d1Trial3",
	"San400071", "SocfbUf21", "SlashdotZoo", "Sw1000060d3L2", "Ex4", "OrkutLinks",
	"Ibm32", "Appu", "Sw100030d2Trial1", "SocDogster", "Jagmesh5", "Grid2",
	"G66", "Mri2", "Diag", "SocfbUchicago30", "SocfbWilliams40", "Actor", "SocfbBrown11",
	"T520", "Tf18", "BioCeLc", "Sw10030d3Trial1", "T60k", "Bcsstk33", "Crack",
	"Cl100002d0Trial3", "SocfbSanta74", "SocfbCornell5", "Air04", "PetsterFriendshipsDog",
	"Sw1000060d2Trial1", "BioGridFissionYeast", "Sw10040d2Trial1", "Pct20stif",
	"ComYoutube", "PetsterFriendshipsCat", "SocfbHarvard1", "Hugetrace00000",
	"Brock4003", "Polblogs", "Hugetrace00010", "Cl10001d9Trial3", "Roget",
	"G14", "WebPolblogs", "ArenasPgp", "Netscience", "SocfbVirginia63", "Plc6030L2",
	"Gene", "FoodwebBaywet", "G22", "Indochina2004", "Bcspwr01", "BioGridHuman",
	"Coauthorsciteseer", "SocBlogcatalog", "BioScCc", "SocFoursquare", "Bcsstm22",
	"Qa8fm", "SocfbWellesley22", "Halfb", "ComAmazon", "RoadRoadUsa", "SocfbUconn",
	"EmailEnronOnly", "UcidataGama", "Dd68", "Sw10050d1Trial3", "SocfbUga50",
	"Pkustk06", "Cl1000001d9Trial1", "Sw10050d2Trial2", "SocYoutube", "Stufe10",
	"Sw100060d1Trial2", "Cl10000002d0Trial3", "Sphere2", "Enzymes118", "SocfbIndiana",
	"Opt1", "G40", "Sw100060d2Trial3", "G50", "EconPsmigr2", "Sw100050d3Trial2",
	"SocfbMit8", "P2pGnutella04", "DblpAuthor", "Citationciteseer", "Cl10001d7Trial1",
	"Sw10060d3Trial3", "Sw1000040d3Trial3", "InfOpenflights", "NR08blocks",
	"Ig513", "Channel500x100x100B050", "TechAsCaida2007", "Sw1000030d2Trial3",
	"Twitter", "Johnson824", "Cl10000001d8Trial3", "Sw1000030d1Trial2", "Copter1",
	"PHat15001", "Tf11", "Dixmaanl", "BioHumanGene2", "FsFa", "Cl1000002d1Trial1",
	"Wave", "Gupta3", "Jgl011", "Dd242", "FeSphere", "Bcsstm08", "SocfbNipsEgo",
	"Net41", "TechArenasJazz", "Cl10001d8Trial3", "SocfbVermont70", "SocDigg",
	"Sw10040d3Trial1", "Uk2005", "InfPower", "Sw1000060d3Trial1", "WebUk2005All",
	"Lock1074", "PetsterFriendshipsHamster", "SocfbRutgers89", "Cl100002d1Trial3",
	"RoadAsiaOsm", "Sw10030d2Trial1", "CFat50010", "Brock2002", "Tf14", "Rajat06",
	"Ig516", "As22july06", "CFat2005", "WebkbWisc", "Cl10000001d7Trial1", "SocfbUcsc68",
	"Shock9", "San200091", "CondMat", "Cities", "Rail4284", "SocfbYale4", "Lshp3466",
	"S4dkt3m2", "Debr", "Bcspwr04", "G37", "G27", "Sw100030d3Trial1", "MaayanStelzl",
	"Struct4", "SocfbMich67", "Cl10002d0Trial3", "Kleemin", "Jagmesh9", "Lp1",
	"Trec7", "PHat7003", "AffWikiEnArticleCat", "Cage4", "Sw1000050d1Trial1",
	"SocfbUf", "Erdos971", "Pkustk03", "Pkustk13", "ScNasasrb", "G55", "G45",
	"California", "RoadLuxembourgOsm", "Cl100001d9Trial3", "Sw100040d2Trial1",
	"CaCsphd", "UcidataZachary", "Cl1000002d0Trial1", "SocPhysicians", "SocLivejournal1",
	"Crystm02", "G63", "NR130bit", "SocfbGwu54", "Dblp2010", "Hamming64", "Amazon0601",
	"SocLocBrightkite", "EmailEnronLarge", "C40005", "Sw1000030d3Trial3", "SocThemarker",
	"InfUsair97", "RoadRoadnetPa", "Pli", "MaayanVidal", "SocfbUcla", "SocTribes",
	"Cl10000001d9Trial3", "SocfbAuburn71", "Webbase1m", "Amazon0505", "Sw1000040d2Trial3",
	"P2pGnutella08", "Sw10060d2Trial3", "Bcsstm11", "CoPapersDblp", "SfhhConfSensor",
	"Sw1000040d1Trial2", "Cage13", "Enzymes296", "Sw10060d1Trial2", "Epinions",
	"Ig56", "Rgg010", "SocfbTennessee95", "Sw100050d2Trial2", "Coater1", "Sw100050d1Trial3",
	"FlickrGroupmemberships", "Cl10000002d1Trial3", "Lesmis", "SocEpinions",
	"G3rmt3m3", "InfectDublin", "Sw100060d3Trial3", "FeOcean", "Gen200P0955",
	"G3", "Usair97", "C2509", "Cl100001d7Trial1", "SocfbTemple83", "Sanr40005",
	"Lederberg", "Lshp1882", "Lock2232", "WebHudong", "Cl1000001d8Trial1",
	"Sw10050d3Trial2", "Internet", "DbpediaProducer", "SocHamsterster", "Net125",
	"SocfbUciUni", "Coauthorsdblp", "Keller6", "FbMessages", "SocfbVassar85",
	"SocAnybeat", "Brack2", "SocfbTrinity100", "Aa4", "RtHiggs", "Ex1", "Sw1000030d3Trial2",
	"SocSlashdotZoo", "San400091", "PHat5001", "SocfbPrinceton12", "Cl10000001d9Trial2",
	"ContiguousUsa", "Cegb3024", "CitPatents", "BioCeGn", "San1000", "SocfbAAnon",
	"Lshp2614", "G62", "Crystm03", "SocfbSyracuse56", "Sw100050d2Trial3", "G10",
	"Divorce", "RoadChesapeake", "Curtis54", "Ig57", "Flickredges", "Sw100050d1Trial2",
	"SocSlashdot0811", "Linux", "Sw10060d2Trial2", "P2pGnutella09", "Sw1000040d2Trial2",
	"Sw10060d1Trial3", "Enzymes297", "Cage12", "AffOrkutUser2groups", "Sw1000040d1Trial3",
	"BNMouseRetina", "LivejournalGroupmemberships", "WebIt2004", "SocfbUc64",
	"G2", "BioDmCx", "Sw10050d3Trial3", "CaDblp2010", "SocfbPepperdine86",
	"WikiEnCat", "Reuters911", "Cl10000002d1Trial2", "WebWikiChInternal", "Hamming102",
	"Crew1", "Eris1176", "SocfbUcsb37", "BNFlyDrosophilaMedulla", "Sw100060d3Trial2",
	"Gen200P0944", "Oregon1", "Ins2", "Sk2005", "Aa5", "Jagmesh1", "SocGowalla",
	"Tomographic1", "Jazz", "CaImdb", "Lshp3025", "Dd687", "InfContiguousUsa",
	"Nw14", "ArenasJazz", "Cyl6", "Scimet", "SocfbSmith60", "Gen400P0955",
	"RoadUsroads48", "Bcsstm19", "Net50", "Bcsstm09", "M14b", "Mip1", "Ford1",
	"Dd21", "BioDmela", "Smagri", "Cl10001d8Trial2", "Harvard500", "Gent113",
	"Dd349", "Aa03", "TechAs22july06", "Sanr20007", "Brock2003", "Enzymes123",
	"Tf15", "BioScLc", "SocSlashdot0902", "Cl100002d1Trial2", "Wing", "Sw10030d1Trial1",
	"NR192bit", "Ig517", "Rajat07", "Eu2005", "Jagmesh8", "Brock8001", "Erdos02",
	"CoPapersCiteseer", "Cl10002d0Trial2", "Bcsstm26", "Trec6", "TechAsSkitter",
	"WebArabic2005", "CitDblp", "WikiTalk", "Lshp1009", "SocfbLehigh96", "AffDbpediaUsers2country",
	"SocfbTulane29", "MannA45", "G26", "NR598a", "DbpediaAll", "Bcspwr05",
	"Cegb3306", "G36", "Pf2177", "MannA27", "SocLivejournal07", "SocfbGeorgetown15",
	"Sw100040d1Trial1", "G44", "G54", "Odlis", "Cl100001d9Trial2", "Cage5",
	"PHat7002", "DbpediaStarring", "Sw1000050d2Trial1", "WebSpam", "Pkustk12",
	"WebBaiduBaike", "Pkustk02", "WebClueweb09", "WebCc12Payleveldomain", "SocfbBingham82",
	"BioYeast", "CiteulikeUi", "CiteulikeTi", "Lpl1", "BioScGt", "Sw100050d2Trial1",
	"Coater2", "CopresenceLyonschool", "Cage10", "Sw1000040d1Trial1", "Enzymes295",
	"Sw10060d1Trial1", "CaHepph", "WebWebbase2001All", "Bcsstm02", "NR176bit",
	"EmailEnron", "PHat5003", "PrimarySchoolProximity", "SocfbWilliam77", "Air02",
	"SocfbUmass92", "Minnesota", "Smallw", "Crystm01", "OpsahlOpenflights",
	"G60", "Friendster", "LivejournalLinks", "SocCatster", "L", "Cl1000002d0Trial2",
	"Livejournal", "P2pGnutella24", "Ex2", "T03314l", "Enron", "Jagmesh3",
	"SocfbMississippi66", "Keller5", "Csphd", "BioGridYeast", "TechIp", "C1259",
	"SocfbMiddlebury45", "SocLivemocha", "Trec14", "InfectHyper", "NR144",
	"Cl1000001d8Trial2", "Sw10050d3Trial1", "CaDblp2012", "CopresenceLh10",
	"Ash219", "Cl100001d7Trial2", "SocWikiTalkDir", "L9", "Dbpedia", "Pkustk09",
	"CaOpsahlCollaboration", "Crplat2", "Dd6", "Eat", "EmailDncCorecipient",
	"Aa01", "Adaptive", "Cl10000001d7Trial2", "BioHsHt", "RoadBelgiumOsm",
	"Ig515", "CaCiteseer", "Sw10030d1Trial3", "SocBlogcatalogAsu", "ComDblp",
	"Sw10030d2Trial2", "Tf17", "Brock2001", "Net100", "San400051", "Rw5151",
	"EgoFacebook", "SocfbSwarthmore42", "Sw10040d3Trial2", "WebBaiduBaikeRelated",
	"SocOrkutDir", "Sw1000060d3Trial2", "WebGoogle", "FlickrLinks", "BioGridPlant",
	"Ukerbe1", "SocfbUcsd34", "CitHepth2007", "Alemdar", "SocYoutubeSnap",
	"Ragusa18", "BioWormnetV3Benchmark", "CondMat2003", "SocfbWashu32", "WebSk2005All",
	"Sw100040d2Trial2", "C20005", "SocFriendster", "BioCeHt", "SocfbUconn91",
	"G56", "Trdheim", "G9", "G46", "Sw100040d1Trial3", "NR12month1", "Farm",
	"Usroads", "Erdos972", "HepThNew", "Cegb2919", "BioDiseasome", "OrkutGroupmemberships",
	"Sw1000050d2Trial3", "Pkustk10", "Airfoil1", "WebIt2004All", "Sw1000050d1Trial2",
	"Cage7", "TechRlCaida", "WebBerkstan", "Blckhole", "Bcsstm24", "Trec4",
	"Cora", "Brock8003", "SocfbSimmons81", "Venturilevel3", "BioDrCx", "IpTrace",
	"Hugetrace00020", "SocfbCaltech36", "Bcspwr07", "SocTwitterHiggs", "Sw100030d3Trial2",
	"SocfbBAnon", "G24", "CfinderGoogle", "SocfbWesleyan43", "San200092", "RoadRoadnetCa",
	"BioMouseGene", "Sw10030d1Trial2", "Ig514", "Tf16", "Fullb", "Sw10030d2Trial3",
	"CopresenceInvs13", "Cl100002d1Trial1", "SocfbBrandeis99", "BioDmLc", "Sls",
	"Johnson1624", "CiteulikeUt", "Cl10000001d7Trial3", "Amazon2008", "SocfbTexas84",
	"DbpediaWriter", "NR3dtube", "Rw136", "Cl10001d8Trial1", "Cage", "HospitalWardProximity",
	"SocfbDartmouth6", "Ford2", "TechAs735", "MaayanPdzbase", "MaayanFoodweb",
	"Sw1000060d3Trial3", "SocfbUc33", "Sw10040d3Trial3", "MiscLesmis", "BioCelegansneural",
	"Orkut", "Pkustk11", "Sw1000050d2Trial2", "Pkustk01", "Cti", "Cage6", "SocTwitter2010",
	"Sw1000050d1Trial3", "TechRoutersRf", "ScPwtk", "PHat7001", "Power", "Citeseer",
	"Sw100040d2Trial3", "Cl100001d9Trial1", "G47", "AvesWildbirdNetwork", "Sw100040d1Trial2",
	"G8", "G25", "Sw100030d3Trial3", "WikisignedK2", "SocLjournal2008", "G35",
	"Bcspwr06", "CopresenceSfhh", "DbpediaLink", "Auto", "San200093", "Hugetric00020",
	"Trec5", "SocfbVanderbilt48", "Bcsstm25", "NR162bit", "SocfbEmory27", "SocfbUcf52",
	"SocfbCal65", "Odepb400", "TechArenasPgp", "BioCelegansDir", "Cl10002d0Trial1",
	"Brock8002", "Cegb2802", "SocFlixster", "SocfbRice31", "Ash85", "SocfbPenn94",
	"Cage11", "Fa", "Sw10060d2Trial1", "Sw1000040d2Trial1", "GottronExcellent",
	"Sw100050d1Trial1", "SocWikiVote", "VisualizeUs", "Pgpgiantcompo", "SocBrightkite",
	"EcoMangwet", "SocKarate", "M3plates", "Brock4004", "SocLivejournalUserGroups",
	"SocStudentCoop", "G61", "WbEdu", "Cl1000002d0Trial3", "PetsterHamster",
	"ScRel9", "PHat5002", "Stufe", "Cl10000001d9Trial1", "Polbooks", "Ramage02",
	"SocFlickrAsu", "Sw1000030d3Trial1", "CaHollywood2009", "WebNotredame",
	"CaMathscinet", "IMDB", "Air03", "WebWebbase2001", "BNMacaqueRhesusBrain",
	"LasagneSpanishbook", "Keller4", "ProteinsAll", "CFat5005", "ScMsdoor",
	"TechWhois", "Lop163", "Net75", "Adjnoun", "P2pGnutella25", "SocfbVillanova62",
	"Sw1000060d3L5", "AstroPh", "Jagmesh2", "Aa6", "Celegansneural", "Hamming82",
	"PowerEris1176", "WebClueweb0950m", "Pkustk08", "Sw100060d3Trial1", "Oregon2",
	"SocFlickr", "EgoTwitter", "Fcondp2", "BioGridMouse", "Cl10000002d1Trial1",
	"Kl02", "SocfbUillinois", "SocfbUcla26", "SocfbJmu79", "Df2177", "WebUk2002All",
	"Uk", "Cl1000001d8Trial3", "SocfbAmherst41", "SocFlickrUnd", "SocfbHaverford76",
	"Libimseti", "Cl100001d7Trial3", "Sanr40007", "ScShipsec5", "SocfbRochester38",
	"G1",
]
#   def C5009( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def C5009(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the C500-9 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of C500-9 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="C5009",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the C500-9 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of C500-9 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def OpsahlSouthernwomen( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def OpsahlSouthernwomen(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the opsahl-southernwomen graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of opsahl-southernwomen graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="OpsahlSouthernwomen",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the opsahl-southernwomen graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of opsahl-southernwomen graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbNorthwestern25( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbNorthwestern25(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Northwestern25 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Northwestern25 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbNorthwestern25",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Northwestern25 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Northwestern25 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Gen400P0965( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Gen400P0965(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the gen400-p0-9-65 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of gen400-p0-9-65 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Gen400P0965",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the gen400-p0-9-65 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of gen400-p0-9-65 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Gen400P0975( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Gen400P0975(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the gen400-p0-9-75 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of gen400-p0-9-75 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Gen400P0975",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the gen400-p0-9-75 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of gen400-p0-9-75 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def San400073( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def San400073(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the san400-0-7-3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of san400-0-7-3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="San400073",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the san400-0-7-3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of san400-0-7-3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def G29( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G29(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G29 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G29 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G29",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G29 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G29 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10002d1Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10002d1Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000-2d1-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000-2d1-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10002d1Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000-2d1-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000-2d1-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G39( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G39(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G39 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G39 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G39",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G39 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G39 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbUsc35( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUsc35(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-USC35 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-USC35 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUsc35",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-USC35 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-USC35 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Jagmesh7( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Jagmesh7(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the jagmesh7 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of jagmesh7 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Jagmesh7",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the jagmesh7 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of jagmesh7 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Aa3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Aa3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the aa3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of aa3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Aa3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the aa3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of aa3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100030d2Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100030d2Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-3-0d2-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-3-0d2-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100030d2Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-3-0d2-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-3-0d2-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def TechAsCaida( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def TechAsCaida(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the tech-as-caida graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of tech-as-caida graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="TechAsCaida",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the tech-as-caida graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of tech-as-caida graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def ScLdoor( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def ScLdoor(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the sc-ldoor graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of sc-ldoor graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="ScLdoor",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the sc-ldoor graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of sc-ldoor graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}
#   def Trec9( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Trec9(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Trec9 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Trec9 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Trec9",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Trec9 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Trec9 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbBowdoin47( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbBowdoin47(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Bowdoin47 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Bowdoin47 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbBowdoin47",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Bowdoin47 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Bowdoin47 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Bcsstm39( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcsstm39(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcsstm39 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcsstm39 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcsstm39",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcsstm39 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcsstm39 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Dsjc5005( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Dsjc5005(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the DSJC500-5 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of DSJC500-5 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Dsjc5005",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the DSJC500-5 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of DSJC500-5 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def P2pGnutella30( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def P2pGnutella30(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the p2p-Gnutella30 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of p2p-Gnutella30 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="P2pGnutella30",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the p2p-Gnutella30 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of p2p-Gnutella30 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Tube2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Tube2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the tube2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of tube2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Tube2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the tube2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of tube2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Email( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Email(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the email graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of email graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Email",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the email graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of email graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def NR208bit( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def NR208bit(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the 208bit graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of 208bit graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="NR208bit",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the 208bit graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of 208bit graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ex6( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ex6(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the EX6 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of EX6 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ex6",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the EX6 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of EX6 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100030d1Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100030d1Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-3-0d1-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-3-0d1-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100030d1Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-3-0d1-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-3-0d1-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100040d3Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100040d3Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-4-0d3-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-4-0d3-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100040d3Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-4-0d3-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-4-0d3-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl100001d8Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl100001d8Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-10000-1d8-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-10000-1d8-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl100001d8Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-10000-1d8-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-10000-1d8-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def MannA9( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def MannA9(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the MANN-a9 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of MANN-a9 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="MannA9",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the MANN-a9 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of MANN-a9 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Hamming104( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Hamming104(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the hamming10-4 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of hamming10-4 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Hamming104",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the hamming10-4 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of hamming10-4 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def BioScHt( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioScHt(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-SC-HT graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-SC-HT graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{cho2014wormnet,
	        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
	        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
	        journal={Nucleic acids research},
	        volume={42},
	        number={W1},
	        pages={W76--W82},
	        year={2014},
	        publisher={Oxford University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioScHt",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-SC-HT graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-SC-HT graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{cho2014wormnet,
        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
        journal={Nucleic acids research},
        volume={42},
        number={W1},
        pages={W76--W82},
        year={2014},
        publisher={Oxford University Press}
}
#   def InfEuroroad( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def InfEuroroad(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the inf-euroroad graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of inf-euroroad graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="InfEuroroad",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the inf-euroroad graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of inf-euroroad graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}
#   def Cl1000001d7Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl1000001d7Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-100000-1d7-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-100000-1d7-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl1000001d7Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-100000-1d7-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-100000-1d7-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def MannA81( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def MannA81(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the MANN-a81 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of MANN-a81 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="MannA81",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the MANN-a81 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of MANN-a81 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Tsyl201( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Tsyl201(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the tsyl201 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of tsyl201 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Tsyl201",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the tsyl201 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of tsyl201 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G4( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G4(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G4 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G4 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G4",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G4 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G4 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw1000050d3Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000050d3Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-5-0d3-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-5-0d3-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000050d3Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-5-0d3-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-5-0d3-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def YahooMsg( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def YahooMsg(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the yahoo-msg graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of yahoo-msg graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="YahooMsg",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the yahoo-msg graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of yahoo-msg graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Skirt( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Skirt(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the skirt graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of skirt graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Skirt",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the skirt graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of skirt graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Net150( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Net150(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the net150 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of net150 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Net150",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the net150 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of net150 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def DbpediaTeam( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def DbpediaTeam(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the dbpedia-team graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of dbpedia-team graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="DbpediaTeam",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the dbpedia-team graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of dbpedia-team graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def PowerBcspwr09( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def PowerBcspwr09(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the power-bcspwr09 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of power-bcspwr09 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="PowerBcspwr09",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the power-bcspwr09 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of power-bcspwr09 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Dictionary28( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Dictionary28(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the dictionary28 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of dictionary28 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Dictionary28",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the dictionary28 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of dictionary28 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Trec10( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Trec10(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Trec10 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Trec10 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Trec10",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Trec10 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Trec10 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Barth5( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Barth5(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the barth5 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of barth5 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Barth5",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the barth5 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of barth5 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Foldoc( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Foldoc(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the foldoc graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of foldoc graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Foldoc",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the foldoc graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of foldoc graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw10040d1Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10040d1Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-4-0d1-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-4-0d1-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10040d1Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-4-0d1-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-4-0d1-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Bcsstm06( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcsstm06(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcsstm06 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcsstm06 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcsstm06",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcsstm06 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcsstm06 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw1000060d1Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000060d1Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-6-0d1-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-6-0d1-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000060d1Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-6-0d1-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-6-0d1-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw10040d2Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10040d2Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-4-0d2-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-4-0d2-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10040d2Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-4-0d2-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-4-0d2-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def EcoStmarks( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def EcoStmarks(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the eco-stmarks graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of eco-stmarks graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{ulanowicz1998network,
	        title={Network analysis of trophic dynamics in south florida ecosystems},
	        author={Ulanowicz, Robert E and DeAngelis, Donald L},
	        journal={FY97: The Florida Bay Ecosystem},
	        pages={20688--20038},
	        year={1998}
	}
	
	@article{melian2004food,
	        title={Food web cohesion},
	        author={Meli{\'a}n,
	Carlos J and Bascompte, Jordi},
	        journal={Ecology},
	        volume={85},
	        number={2},
	        pages={352--358},
	        year={2004},
	        publisher={Eco Soc America}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="EcoStmarks",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the eco-stmarks graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of eco-stmarks graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{ulanowicz1998network,
        title={Network analysis of trophic dynamics in south florida ecosystems},
        author={Ulanowicz, Robert E and DeAngelis, Donald L},
        journal={FY97: The Florida Bay Ecosystem},
        pages={20688--20038},
        year={1998}
}

@article{melian2004food,
        title={Food web cohesion},
        author={Meli{'a}n,
Carlos J and Bascompte, Jordi},
        journal={Ecology},
        volume={85},
        number={2},
        pages={352--358},
        year={2004},
        publisher={Eco Soc America}
}
#   def Sw1000060d2Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000060d2Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-6-0d2-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-6-0d2-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000060d2Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-6-0d2-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-6-0d2-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Patentcite( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Patentcite(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the patentcite graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of patentcite graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Patentcite",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the patentcite graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of patentcite graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Johnson3224( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Johnson3224(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the johnson32-2-4 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of johnson32-2-4 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Johnson3224",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the johnson32-2-4 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of johnson32-2-4 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def EmailEuall( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def EmailEuall(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the email-EuAll graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of email-EuAll graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="EmailEuall",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the email-EuAll graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of email-EuAll graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocSinaweibo( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocSinaweibo(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-sinaweibo graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-sinaweibo graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@incollection{zhang2014characterizing,
	        title={Characterizing Tweeting Behaviors of Sina Weibo Users via Public Data Streaming},
	        author={Zhang, Kai and Yu, Qian and Lei, Kai and Xu, Kuai},
	        booktitle={Web-Age Information Management},
	        pages={294--297},
	        year={2014},
	        publisher={Springer}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocSinaweibo",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-sinaweibo graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-sinaweibo graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@incollection{zhang2014characterizing,
        title={Characterizing Tweeting Behaviors of Sina Weibo Users via Public Data Streaming},
        author={Zhang, Kai and Yu, Qian and Lei, Kai and Xu, Kuai},
        booktitle={Web-Age Information Management},
        pages={294--297},
        year={2014},
        publisher={Springer}
}
#   def Cage14( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cage14(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cage14 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cage14 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cage14",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cage14 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cage14 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G16( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G16(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G16 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G16 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G16",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G16 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G16 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10001d9Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10001d9Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000-1d9-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000-1d9-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10001d9Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000-1d9-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000-1d9-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def ActorCollaboration( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def ActorCollaboration(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the actor-collaboration graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of actor-collaboration graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="ActorCollaboration",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the actor-collaboration graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of actor-collaboration graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Kohonen( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Kohonen(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Kohonen graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Kohonen graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Kohonen",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Kohonen graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Kohonen graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocHighschoolMoreno( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocHighschoolMoreno(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-highschool-moreno graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-highschool-moreno graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocHighschoolMoreno",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-highschool-moreno graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-highschool-moreno graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Biplane9( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Biplane9(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the biplane-9 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of biplane-9 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Biplane9",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the biplane-9 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of biplane-9 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Brock4001( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Brock4001(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the brock400-1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of brock400-1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Brock4001",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the brock400-1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of brock400-1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Plc4030L5( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Plc4030L5(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the PLC-40-30-L5 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of PLC-40-30-L5 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Plc4030L5",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the PLC-40-30-L5 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of PLC-40-30-L5 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbMsu24( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbMsu24(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-MSU24 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-MSU24 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbMsu24",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-MSU24 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-MSU24 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def SocfbJohnshopkins55( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbJohnshopkins55(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-JohnsHopkins55 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-JohnsHopkins55 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbJohnshopkins55",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-JohnsHopkins55 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-JohnsHopkins55 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Ljournal2008( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ljournal2008(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ljournal-2008 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ljournal-2008 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ljournal2008",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ljournal-2008 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ljournal-2008 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ig518( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ig518(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the IG5-18 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of IG5-18 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ig518",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the IG5-18 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of IG5-18 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G64( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G64(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G64 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G64 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G64",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G64 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G64 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Rajat08( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Rajat08(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the rajat08 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of rajat08 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Rajat08",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the rajat08 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of rajat08 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Finance256( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Finance256(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the finance256 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of finance256 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Finance256",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the finance256 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of finance256 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocLivejournal( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocLivejournal(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-livejournal graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-livejournal graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{mislove-2007-socialnetworks,
	        author = {Alan Mislove and Massimiliano Marcon and Krishna P. Gummadi and Peter Druschel and Bobby Bhattacharjee},
	        title = {{Measurement and Analysis of Online Social Networks}},
	        booktitle = {Proceedings of the 5th ACM/Usenix Internet Measurement Conference (IMC'07)},
	        address = {San Diego, CA},
	        month = {October},
	        year = {2007}}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocLivejournal",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-livejournal graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-livejournal graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{mislove-2007-socialnetworks,
        author = {Alan Mislove and Massimiliano Marcon and Krishna P. Gummadi and Peter Druschel and Bobby Bhattacharjee},
        title = {{Measurement and Analysis of Online Social Networks}},
        booktitle = {Proceedings of the 5th ACM/Usenix Internet Measurement Conference (IMC'07)},
        address = {San Diego, CA},
        month = {October},
        year = {2007}}
#   def Air06( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Air06(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the air06 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of air06 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Air06",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the air06 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of air06 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl100002d0Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl100002d0Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-10000-2d0-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-10000-2d0-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl100002d0Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-10000-2d0-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-10000-2d0-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def FeBody( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def FeBody(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the fe-body graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of fe-body graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="FeBody",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the fe-body graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of fe-body graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}
#   def Bcsstk31( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcsstk31(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcsstk31 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcsstk31 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcsstk31",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcsstk31 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcsstk31 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocAnuResidence( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocAnuResidence(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-ANU-residence graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-ANU-residence graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocAnuResidence",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-ANU-residence graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-ANU-residence graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Engine( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Engine(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the engine graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of engine graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Engine",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the engine graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of engine graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw10030d3Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10030d3Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-3-0d3-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-3-0d3-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10030d3Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-3-0d3-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-3-0d3-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cage3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cage3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cage3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cage3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cage3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cage3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cage3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CaHepth( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CaHepth(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ca-HepTh graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ca-HepTh graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CaHepth",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ca-HepTh graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ca-HepTh graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def FoodwebBaydry( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def FoodwebBaydry(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the foodweb-baydry graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of foodweb-baydry graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="FoodwebBaydry",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the foodweb-baydry graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of foodweb-baydry graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbOberlin44( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbOberlin44(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Oberlin44 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Oberlin44 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbOberlin44",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Oberlin44 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Oberlin44 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def SocTwitter( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocTwitter(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-twitter graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-twitter graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{friendster,
	        author = {Friendster social network},
	        title = {Friendster: The online gaming social network},
	        note = {{https://archive.org/details/friendster-dataset-201107}}}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocTwitter",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-twitter graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-twitter graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{friendster,
        author = {Friendster social network},
        title = {Friendster: The online gaming social network},
        note = {{https://archive.org/details/friendster-dataset-201107}}}
#   def Cl1000001d9Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl1000001d9Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-100000-1d9-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-100000-1d9-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl1000001d9Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-100000-1d9-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-100000-1d9-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def MiscImdbBi( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def MiscImdbBi(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the misc-IMDB-bi graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of misc-IMDB-bi graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@book{de2011exploratory,
	        title={Exploratory social network analysis with Pajek},
	        author={De Nooy, Wouter and Mrvar, Andrej and Batagelj, Vladimir},
	        volume={27},
	        year={2011},
	        publisher={Cambridge University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="MiscImdbBi",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the misc-IMDB-bi graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of misc-IMDB-bi graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@book{de2011exploratory,
        title={Exploratory social network analysis with Pajek},
        author={De Nooy, Wouter and Mrvar, Andrej and Batagelj, Vladimir},
        volume={27},
        year={2011},
        publisher={Cambridge University Press}
}
#   def Pkustk04( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pkustk04(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the pkustk04 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of pkustk04 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pkustk04",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the pkustk04 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of pkustk04 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Pkustk14( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pkustk14(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the pkustk14 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of pkustk14 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pkustk14",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the pkustk14 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of pkustk14 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BNHumanJung( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BNHumanJung(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bn-human-Jung graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bn-human-Jung graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article {bigbrain,
	     author = {Amunts, Katrin and Lepage, Claude and Borgeat, Louis and Mohlberg, Hartmut and Dickscheid, Timo and Rousseau, Marc-{'E}tienne and Bludau,
	Sebastian and Bazin, Pierre-Louis and Lewis, Lindsay B. and Oros-Peusquens, Ana-Maria and Shah, Nadim J. and Lippert, Thomas and Zilles, Karl and Evans, Alan C.},
	     title = {BigBrain: An Ultrahigh-Resolution 3D Human Brain Model},
	     volume = {340},
	     number = {6139},
	     pages = {1472--1475},
	     year = {2013},
	     publisher = {AAAS},
	     journal = {Science}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BNHumanJung",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bn-human-Jung graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bn-human-Jung graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article {bigbrain,
     author = {Amunts, Katrin and Lepage, Claude and Borgeat, Louis and Mohlberg, Hartmut and Dickscheid, Timo and Rousseau, Marc-{'E}tienne and Bludau,
Sebastian and Bazin, Pierre-Louis and Lewis, Lindsay B. and Oros-Peusquens, Ana-Maria and Shah, Nadim J. and Lippert, Thomas and Zilles, Karl and Evans, Alan C.},
     title = {BigBrain: An Ultrahigh-Resolution 3D Human Brain Model},
     volume = {340},
     number = {6139},
     pages = {1472--1475},
     year = {2013},
     publisher = {AAAS},
     journal = {Science}
}
#   def Sw10050d1Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10050d1Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-5-0d1-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-5-0d1-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10050d1Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-5-0d1-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-5-0d1-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioScTs( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioScTs(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-SC-TS graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-SC-TS graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{cho2014wormnet,
	        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
	        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
	        journal={Nucleic acids research},
	        volume={42},
	        number={W1},
	        pages={W76--W82},
	        year={2014},
	        publisher={Oxford University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioScTs",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-SC-TS graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-SC-TS graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{cho2014wormnet,
        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
        journal={Nucleic acids research},
        volume={42},
        number={W1},
        pages={W76--W82},
        year={2014},
        publisher={Oxford University Press}
}
#   def G52( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G52(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G52 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G52 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G52",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G52 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G52 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100060d2Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100060d2Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-6-0d2-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-6-0d2-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100060d2Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-6-0d2-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-6-0d2-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def DbpediaRecordlabel( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def DbpediaRecordlabel(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the dbpedia-recordlabel graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of dbpedia-recordlabel graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="DbpediaRecordlabel",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the dbpedia-recordlabel graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of dbpedia-recordlabel graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G42( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G42(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G42 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G42 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G42",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G42 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G42 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def PowerBcspwr10( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def PowerBcspwr10(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the power-bcspwr10 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of power-bcspwr10 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="PowerBcspwr10",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the power-bcspwr10 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of power-bcspwr10 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10000002d0Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10000002d0Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000000-2d0-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000000-2d0-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10000002d0Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000000-2d0-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000000-2d0-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbMaryland58( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbMaryland58(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Maryland58 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Maryland58 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbMaryland58",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Maryland58 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Maryland58 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Rw496( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Rw496(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the rw496 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of rw496 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Rw496",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the rw496 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of rw496 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Se( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Se(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the se graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of se graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Se",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the se graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of se graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10k1d8L5( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10k1d8L5(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-10K-1d8-L5 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-10K-1d8-L5 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10k1d8L5",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-10K-1d8-L5 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-10K-1d8-L5 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def RoadnetPa( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def RoadnetPa(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the roadNet-PA graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of roadNet-PA graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="RoadnetPa",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the roadNet-PA graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of roadNet-PA graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Bcspwr03( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcspwr03(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcspwr03 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcspwr03 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcspwr03",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcspwr03 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcspwr03 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocDelicious( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocDelicious(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-delicious graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-delicious graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{zafarani2014users,
	        title={Users Joining Multiple Sites: Distributions and Patterns},
	        author={Zafarani, Reza and Liu, Huan},
	        booktitle = {Proceedings of the 8th International AAAI Conference on Weblogs and Social Media (ICWSM'14)},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocDelicious",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-delicious graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-delicious graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{zafarani2014users,
        title={Users Joining Multiple Sites: Distributions and Patterns},
        author={Zafarani, Reza and Liu, Huan},
        booktitle = {Proceedings of the 8th International AAAI Conference on Weblogs and Social Media (ICWSM'14)},
        year={2014}
}
#   def G30( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G30(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G30 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G30 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G30",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G30 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G30 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def RoadNetherlandsOsm( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def RoadNetherlandsOsm(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the road-netherlands-osm graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of road-netherlands-osm graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="RoadNetherlandsOsm",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the road-netherlands-osm graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of road-netherlands-osm graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Dolphins( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Dolphins(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the dolphins graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of dolphins graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Dolphins",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the dolphins graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of dolphins graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def InfRoadnetPa( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def InfRoadnetPa(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the inf-roadNet-PA graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of inf-roadNet-PA graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="InfRoadnetPa",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the inf-roadNet-PA graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of inf-roadNet-PA graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}
#   def SocfbBc17( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbBc17(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-BC17 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-BC17 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbBc17",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-BC17 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-BC17 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Pcrystk03( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pcrystk03(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the pcrystk03 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of pcrystk03 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pcrystk03",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the pcrystk03 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of pcrystk03 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Struct3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Struct3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the struct3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of struct3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Struct3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the struct3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of struct3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def TechArenasMeta( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def TechArenasMeta(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the tech-arenas-meta graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of tech-arenas-meta graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="TechArenasMeta",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the tech-arenas-meta graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of tech-arenas-meta graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Bcsstm20( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcsstm20(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcsstm20 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcsstm20 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcsstm20",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcsstm20 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcsstm20 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Patents( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Patents(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the patents graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of patents graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Patents",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the patents graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of patents graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def AffFlickrUserGroups( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def AffFlickrUserGroups(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the aff-flickr-user-groups graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of aff-flickr-user-groups graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="AffFlickrUserGroups",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the aff-flickr-user-groups graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of aff-flickr-user-groups graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ash958( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ash958(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ash958 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ash958 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ash958",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ash958 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ash958 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def PHat15003( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def PHat15003(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the p-hat1500-3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of p-hat1500-3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="PHat15003",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the p-hat1500-3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of p-hat1500-3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Tf13( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Tf13(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the TF13 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of TF13 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Tf13",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the TF13 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of TF13 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10000001d8Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10000001d8Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000000-1d8-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000000-1d8-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10000001d8Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000000-1d8-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000000-1d8-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbHoward90( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbHoward90(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Howard90 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Howard90 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbHoward90",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Howard90 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Howard90 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Enzymes8( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Enzymes8(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ENZYMES8 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ENZYMES8 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Enzymes8",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ENZYMES8 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ENZYMES8 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CFat2002( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CFat2002(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the c-fat200-2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of c-fat200-2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CFat2002",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the c-fat200-2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of c-fat200-2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Rajat01( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Rajat01(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the rajat01 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of rajat01 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Rajat01",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the rajat01 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of rajat01 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw1000030d2Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000030d2Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-3-0d2-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-3-0d2-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000030d2Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-3-0d2-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-3-0d2-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Pds10( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pds10(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the pds10 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of pds10 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pds10",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the pds10 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of pds10 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocDolphins( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocDolphins(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-dolphins graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-dolphins graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{lusseau2003bottlenose,
	        title={The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations},
	        author={Lusseau, David and Schneider, Karsten and Boisseau, Oliver J and Haase, Patti and Slooten, Elisabeth and Dawson, Steve M},
	        journal={Behavioral Ecology and Sociobiology},
	        volume={54},
	        number={4},
	        pages={396--405},
	        year={2003},
	        publisher={Springer}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocDolphins",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-dolphins graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-dolphins graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{lusseau2003bottlenose,
        title={The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations},
        author={Lusseau, David and Schneider, Karsten and Boisseau, Oliver J and Haase, Patti and Slooten, Elisabeth and Dawson, Steve M},
        journal={Behavioral Ecology and Sociobiology},
        volume={54},
        number={4},
        pages={396--405},
        year={2003},
        publisher={Springer}
}
#   def Ig511( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ig511(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the IG5-11 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of IG5-11 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ig511",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the IG5-11 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of IG5-11 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Lshp1561( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Lshp1561(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the lshp1561 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of lshp1561 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Lshp1561",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the lshp1561 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of lshp1561 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ash292( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ash292(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ash292 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ash292 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ash292",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ash292 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ash292 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbAmerican75( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbAmerican75(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-American75 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-American75 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbAmerican75",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-American75 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-American75 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def SocfbMit( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbMit(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-MIT graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-MIT graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbMit",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-MIT graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-MIT graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Gupta1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Gupta1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the gupta1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of gupta1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Gupta1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the gupta1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of gupta1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbHamilton46( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbHamilton46(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Hamilton46 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Hamilton46 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbHamilton46",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Hamilton46 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Hamilton46 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def San200072( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def San200072(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the san200-0-7-2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of san200-0-7-2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="San200072",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the san200-0-7-2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of san200-0-7-2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Dsjc10005( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Dsjc10005(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the DSJC1000-5 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of DSJC1000-5 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Dsjc10005",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the DSJC1000-5 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of DSJC1000-5 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Cl1000002d1Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl1000002d1Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-100000-2d1-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-100000-2d1-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl1000002d1Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-100000-2d1-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-100000-2d1-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def P2pGnutella06( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def P2pGnutella06(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the p2p-Gnutella06 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of p2p-Gnutella06 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="P2pGnutella06",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the p2p-Gnutella06 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of p2p-Gnutella06 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Packing500x100x100B050( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Packing500x100x100B050(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the packing-500x100x100-b050 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of packing-500x100x100-b050 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Packing500x100x100B050",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the packing-500x100x100-b050 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of packing-500x100x100-b050 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioCeGt( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioCeGt(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-CE-GT graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-CE-GT graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{cho2014wormnet,
	        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
	        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
	        journal={Nucleic acids research},
	        volume={42},
	        number={W1},
	        pages={W76--W82},
	        year={2014},
	        publisher={Oxford University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioCeGt",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-CE-GT graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-CE-GT graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{cho2014wormnet,
        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
        journal={Nucleic acids research},
        volume={42},
        number={W1},
        pages={W76--W82},
        year={2014},
        publisher={Oxford University Press}
}
#   def ActorMovie( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def ActorMovie(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the actor-movie graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of actor-movie graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="ActorMovie",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the actor-movie graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of actor-movie graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def MiscJungCodeDep( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def MiscJungCodeDep(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the misc-jung-code-dep graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of misc-jung-code-dep graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{jung-code-dep,
	        author = {\v{S}ubelj,
	Lovro and Bajec, Marko},
	        title = {Software Systems through Complex Networks Science: Review, Analysis and Applications},
	        booktitle = {Proc. Int. Workshop on Software Mining},
	        year = {2012},
	        isbn = {978-1-4503-1560-9},
	        pages = {9--16},
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="MiscJungCodeDep",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the misc-jung-code-dep graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of misc-jung-code-dep graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{jung-code-dep,
        author = {
 - **{S}ubelj,**: Lovro and Bajec, Marko},
        title = {Software Systems through Complex Networks Science: Review, Analysis and Applications},
        booktitle = {Proc. Int. Workshop on Software Mining},
        year = {2012},
        isbn = {978-1-4503-1560-9},
        pages = {9--16},
}
#   def PHat3003( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def PHat3003(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the p-hat300-3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of p-hat300-3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="PHat3003",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the p-hat300-3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of p-hat300-3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def SocSlashdot( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocSlashdot(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-slashdot graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-slashdot graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{leskovec2009community,
	        title={Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters},
	        author={Leskovec, Jure and Lang, Kevin J and Dasgupta, Anirban and Mahoney, Michael W},
	        journal={Internet Mathematics},
	        volume={6},
	        number={1},
	        pages={29--123},
	        year={2009},
	        publisher={Taylor \& Francis}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocSlashdot",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-slashdot graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-slashdot graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{leskovec2009community,
        title={Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters},
        author={Leskovec, Jure and Lang, Kevin J and Dasgupta, Anirban and Mahoney, Michael W},
        journal={Internet Mathematics},
        volume={6},
        number={1},
        pages={29--123},
        year={2009},
        publisher={Taylor \& Francis}
}
#   def Data( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Data(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the data graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of data graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Data",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the data graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of data graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ash331( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ash331(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ash331 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ash331 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ash331",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ash331 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ash331 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Uk2002( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Uk2002(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the uk-2002 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of uk-2002 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Uk2002",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the uk-2002 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of uk-2002 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Erdos992( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Erdos992(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Erdos992 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Erdos992 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Erdos992",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Erdos992 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Erdos992 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Erdos982( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Erdos982(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Erdos982 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Erdos982 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Erdos982",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Erdos982 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Erdos982 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ig58( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ig58(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the IG5-8 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of IG5-8 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ig58",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the IG5-8 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of IG5-8 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def PHat10002( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def PHat10002(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the p-hat1000-2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of p-hat1000-2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="PHat10002",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the p-hat1000-2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of p-hat1000-2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Uspowergrid( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Uspowergrid(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the USpowerGrid graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of USpowerGrid graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Uspowergrid",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the USpowerGrid graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of USpowerGrid graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def AffGithubUser2project( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def AffGithubUser2project(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the aff-github-user2project graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of aff-github-user2project graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{aff-github-user2project,
	        author = {Scott Chacon},
	        title = {The 2009 GitHub Contest},
	        month = {July},
	        year = {2009}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="AffGithubUser2project",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the aff-github-user2project graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of aff-github-user2project graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{aff-github-user2project,
        author = {Scott Chacon},
        title = {The 2009 GitHub Contest},
        month = {July},
        year = {2009}
}
#   def RtRetweet( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def RtRetweet(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the rt-retweet graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of rt-retweet graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{rossi2012fastclique,
	        title={What if CLIQUE were fast? Maximum Cliques in Information Networks and Strong Components in Temporal Networks},
	        author={Ryan A. Rossi and David F. Gleich and Assefaw H. Gebremedhin and Mostofa A. Patwary},
	        journal={arXiv preprint arXiv:1210.5802},
	        pages={1--11},
	        year={2012}
	}
	
	@inproceedings{rossi2014pmc-www,
	        title={Fast Maximum Clique Algorithms for Large Graphs},
	        author={Ryan A. Rossi and David F. Gleich and Assefaw H. Gebremedhin and     Mostofa A. Patwary},
	        booktitle={Proceedings of the 23rd International Conference on World     Wide Web (WWW)},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="RtRetweet",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the rt-retweet graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of rt-retweet graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{rossi2012fastclique,
        title={What if CLIQUE were fast? Maximum Cliques in Information Networks and Strong Components in Temporal Networks},
        author={Ryan A. Rossi and David F. Gleich and Assefaw H. Gebremedhin and Mostofa A. Patwary},
        journal={arXiv preprint arXiv:1210.5802},
        pages={1--11},
        year={2012}
}

@inproceedings{rossi2014pmc-www,
        title={Fast Maximum Clique Algorithms for Large Graphs},
        author={Ryan A. Rossi and David F. Gleich and Assefaw H. Gebremedhin and     Mostofa A. Patwary},
        booktitle={Proceedings of the 23rd International Conference on World     Wide Web (WWW)},
        year={2014}
}
#   def CopresenceThiers13( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CopresenceThiers13(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the copresence-Thiers13 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of copresence-Thiers13 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{infect,
	        author={{SocioPatterns}},
	        title={Infectious contact networks},
	        url={http://www.sociopatterns.org/datasets/}}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CopresenceThiers13",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the copresence-Thiers13 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of copresence-Thiers13 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{infect,
        author={{SocioPatterns}},
        title={Infectious contact networks},
        url={http://www.sociopatterns.org/datasets/}}
#   def Chesapeake( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Chesapeake(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the chesapeake graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of chesapeake graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Chesapeake",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the chesapeake graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of chesapeake graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sstmodel( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sstmodel(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the sstmodel graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of sstmodel graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sstmodel",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the sstmodel graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of sstmodel graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw1000040d3Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000040d3Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-4-0d3-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-4-0d3-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000040d3Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-4-0d3-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-4-0d3-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Johnson844( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Johnson844(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the johnson8-4-4 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of johnson8-4-4 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Johnson844",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the johnson8-4-4 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of johnson8-4-4 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Sw10060d3Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10060d3Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-6-0d3-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-6-0d3-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10060d3Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-6-0d3-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-6-0d3-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10001d7Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10001d7Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000-1d7-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000-1d7-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10001d7Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000-1d7-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000-1d7-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def AffAmazonCopurchases( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def AffAmazonCopurchases(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the aff-amazon-copurchases graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of aff-amazon-copurchases graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{leskovec2007dynamics,
	        title={The dynamics of viral marketing},
	        author={Leskovec, Jure and Adamic, Lada A and Huberman, Bernardo A},
	        journal={ACM Transactions on the Web (TWEB)},
	        volume={1},
	        number={1},
	        pages={5},
	        year={2007},
	        publisher={ACM}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="AffAmazonCopurchases",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the aff-amazon-copurchases graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of aff-amazon-copurchases graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{leskovec2007dynamics,
        title={The dynamics of viral marketing},
        author={Leskovec, Jure and Adamic, Lada A and Huberman, Bernardo A},
        journal={ACM Transactions on the Web (TWEB)},
        volume={1},
        number={1},
        pages={5},
        year={2007},
        publisher={ACM}
}
#   def CaMathscinetDir( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CaMathscinetDir(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ca-MathSciNet-dir graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ca-MathSciNet-dir graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{palla2008fundamental,
	        title={Fundamental statistical features and self-similar properties of tagged networks},
	        author={Palla, Gergely and Farkas, Ill{\'e}s J and Pollner,
	P{\'e}ter and Der{\'e}nyi,
	Imre and Vicsek, Tam{\'a}s},
	        journal={New Journal of Physics},
	        volume={10},
	        number={12},
	        pages={123026},
	        year={2008},
	        publisher={IOP Publishing}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CaMathscinetDir",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ca-MathSciNet-dir graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ca-MathSciNet-dir graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{palla2008fundamental,
        title={Fundamental statistical features and self-similar properties of tagged networks},
        author={Palla, Gergely and Farkas, Ill{'e}s J and Pollner,
P{'e}ter and Der{'e}nyi,
Imre and Vicsek, Tam{'a}s},
        journal={New Journal of Physics},
        volume={10},
        number={12},
        pages={123026},
        year={2008},
        publisher={IOP Publishing}
}
#   def G43( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G43(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G43 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G43 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G43",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G43 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G43 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G53( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G53(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G53 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G53 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G53",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G53 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G53 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def AffDigg( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def AffDigg(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the aff-digg graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of aff-digg graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="AffDigg",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the aff-digg graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of aff-digg graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100060d1Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100060d1Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-6-0d1-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-6-0d1-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100060d1Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-6-0d1-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-6-0d1-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CaCondmat( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CaCondmat(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ca-CondMat graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ca-CondMat graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CaCondmat",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ca-CondMat graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ca-CondMat graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def DblpCite( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def DblpCite(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the dblp-cite graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of dblp-cite graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="DblpCite",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the dblp-cite graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of dblp-cite graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl1000001d9Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl1000001d9Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-100000-1d9-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-100000-1d9-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl1000001d9Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-100000-1d9-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-100000-1d9-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw10050d2Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10050d2Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-5-0d2-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-5-0d2-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10050d2Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-5-0d2-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-5-0d2-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Amazon0302( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Amazon0302(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the amazon0302 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of amazon0302 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Amazon0302",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the amazon0302 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of amazon0302 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Amazon0312( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Amazon0312(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the amazon0312 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of amazon0312 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Amazon0312",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the amazon0312 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of amazon0312 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def TechP2pGnutella( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def TechP2pGnutella(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the tech-p2p-gnutella graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of tech-p2p-gnutella graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{matei2002mapping,
	        title={Mapping the Gnutella network},
	        author={Matei, R. and Iamnitchi, A. and Foster, P.},
	        journal={Internet Computing},
	        volume={6},
	        number={1},
	        pages={50--57},
	        year={2002},
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="TechP2pGnutella",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the tech-p2p-gnutella graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of tech-p2p-gnutella graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{matei2002mapping,
        title={Mapping the Gnutella network},
        author={Matei, R. and Iamnitchi, A. and Foster, P.},
        journal={Internet Computing},
        volume={6},
        number={1},
        pages={50--57},
        year={2002},
}
#   def FbCmuCarnegie49( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def FbCmuCarnegie49(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the fb-CMU-Carnegie49 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of fb-CMU-Carnegie49 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="FbCmuCarnegie49",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the fb-CMU-Carnegie49 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of fb-CMU-Carnegie49 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioCeCx( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioCeCx(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-CE-CX graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-CE-CX graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{cho2014wormnet,
	        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
	        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
	        journal={Nucleic acids research},
	        volume={42},
	        number={W1},
	        pages={W76--W82},
	        year={2014},
	        publisher={Oxford University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioCeCx",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-CE-CX graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-CE-CX graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{cho2014wormnet,
        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
        journal={Nucleic acids research},
        volume={42},
        number={W1},
        pages={W76--W82},
        year={2014},
        publisher={Oxford University Press}
}
#   def Barth( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Barth(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the barth graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of barth graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Barth",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the barth graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of barth graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Pkustk05( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pkustk05(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the pkustk05 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of pkustk05 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pkustk05",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the pkustk05 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of pkustk05 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Srb1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Srb1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the srb1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of srb1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Srb1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the srb1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of srb1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WebIndochina2004All( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebIndochina2004All(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-indochina-2004-all graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-indochina-2004-all graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@ARTICLE{boldi2004-ubicrawler,
	        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
	        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
	        journal = {Software: Practice \& Experience},
	        year = {2004},
	        volume = {34},
	        pages = {711--726},
	        number = {8}}
	
	@INPROCEEDINGS{Boldi-2011-layered,
	        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
	        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering	for Compressing Social Networks},
	        booktitle = {WWW},
	        year = {2011},
	        pages = {587--596}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebIndochina2004All",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-indochina-2004-all graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-indochina-2004-all graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@ARTICLE{boldi2004-ubicrawler,
        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
        journal = {Software: Practice \& Experience},
        year = {2004},
        volume = {34},
        pages = {711--726},
        number = {8}}

@INPROCEEDINGS{Boldi-2011-layered,
        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering  for Compressing Social Networks},
        booktitle = {WWW},
        year = {2011},
        pages = {587--596}
}
#   def Pcrystk02( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pcrystk02(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the pcrystk02 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of pcrystk02 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pcrystk02",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the pcrystk02 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of pcrystk02 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocSlashdotTrustAll( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocSlashdotTrustAll(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-slashdot-trust-all graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-slashdot-trust-all graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{leskovec2009community,
	        title={Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters},
	        author={Leskovec, Jure and Lang, Kevin J and Dasgupta, Anirban and Mahoney, Michael W},
	        journal={Internet Mathematics},
	        volume={6},
	        number={1},
	        pages={29--123},
	        year={2009},
	        publisher={Taylor \& Francis}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocSlashdotTrustAll",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-slashdot-trust-all graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-slashdot-trust-all graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{leskovec2009community,
        title={Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters},
        author={Leskovec, Jure and Lang, Kevin J and Dasgupta, Anirban and Mahoney, Michael W},
        journal={Internet Mathematics},
        volume={6},
        number={1},
        pages={29--123},
        year={2009},
        publisher={Taylor \& Francis}
}
#   def MaayanFigeys( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def MaayanFigeys(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the maayan-figeys graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of maayan-figeys graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="MaayanFigeys",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the maayan-figeys graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of maayan-figeys graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioCelegans( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioCelegans(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-celegans graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-celegans graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{duch2005community,
	        title={Community identification using Extremal Optimization Phys},
	        author={Duch, J. and Arenas, A.},
	        journal={Rev. E},
	        volume={72},
	        pages={027104},
	        year={2005}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioCelegans",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-celegans graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-celegans graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{duch2005community,
        title={Community identification using Extremal Optimization Phys},
        author={Duch, J. and Arenas, A.},
        journal={Rev. E},
        volume={72},
        pages={027104},
        year={2005}
}
#   def As735( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def As735(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the as-735 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of as-735 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="As735",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the as-735 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of as-735 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Bcsstm21( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcsstm21(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcsstm21 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcsstm21 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcsstm21",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcsstm21 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcsstm21 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def AsSkitter( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def AsSkitter(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the as-skitter graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of as-skitter graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="AsSkitter",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the as-skitter graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of as-skitter graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Hollywood2009( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Hollywood2009(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the hollywood-2009 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of hollywood-2009 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Hollywood2009",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the hollywood-2009 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of hollywood-2009 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CaErdos992( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CaErdos992(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ca-Erdos992 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ca-Erdos992 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{batagelj2000some,
	        title={Some analyses of Erdos collaboration graph},
	        author={Batagelj, Vladimir and Mrvar, Andrej},
	        journal={Social Networks},
	        volume={22},
	        number={2},
	        pages={173--186},
	        year={2000},
	        publisher={Elsevier}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CaErdos992",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ca-Erdos992 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ca-Erdos992 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{batagelj2000some,
        title={Some analyses of Erdos collaboration graph},
        author={Batagelj, Vladimir and Mrvar, Andrej},
        journal={Social Networks},
        volume={22},
        number={2},
        pages={173--186},
        year={2000},
        publisher={Elsevier}
}
#   def Dd497( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Dd497(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the DD497 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of DD497 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Dd497",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the DD497 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of DD497 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def ArenasMeta( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def ArenasMeta(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the arenas-meta graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of arenas-meta graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="ArenasMeta",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the arenas-meta graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of arenas-meta graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbFsu53( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbFsu53(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-FSU53 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-FSU53 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbFsu53",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-FSU53 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-FSU53 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def CaNetscience( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CaNetscience(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ca-netscience graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ca-netscience graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{newman2006finding,
	        title={Finding community structure in networks using the eigenvectors of matrices},
	        author={Newman, Mark EJ},
	        journal={Physical review E},
	        volume={74},
	        number={3},
	        pages={036104},
	        year={2006},
	        publisher={APS}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CaNetscience",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ca-netscience graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ca-netscience graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{newman2006finding,
        title={Finding community structure in networks using the eigenvectors of matrices},
        author={Newman, Mark EJ},
        journal={Physical review E},
        volume={74},
        number={3},
        pages={036104},
        year={2006},
        publisher={APS}
}
#   def SocTwitterFollows( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocTwitterFollows(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-twitter-follows graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-twitter-follows graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{dprIM,
	        author = {Gleich, David F. and Rossi, Ryan A.},
	        title = {A Dynamical System for PageRank with Time-Dependent Teleportation},
	        journal = {Internet Mathematics},
	        volume = {10},
	        number = {1-2},
	        pages = {188-217},
	        year = {2014},
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocTwitterFollows",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-twitter-follows graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-twitter-follows graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{dprIM,
        author = {Gleich, David F. and Rossi, Ryan A.},
        title = {A Dynamical System for PageRank with Time-Dependent Teleportation},
        journal = {Internet Mathematics},
        volume = {10},
        number = {1-2},
        pages = {188-217},
        year = {2014},
}
#   def AvesSparrowSocial( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def AvesSparrowSocial(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the aves-sparrow-social graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of aves-sparrow-social graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="AvesSparrowSocial",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the aves-sparrow-social graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of aves-sparrow-social graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbCmu( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbCmu(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-CMU graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-CMU graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbCmu",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-CMU graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-CMU graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def ScPkustk11( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def ScPkustk11(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the sc-pkustk11 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of sc-pkustk11 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="ScPkustk11",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the sc-pkustk11 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of sc-pkustk11 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}
#   def WebEpa( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebEpa(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-EPA graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-EPA graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@book{de2011exploratory,
	        title={Exploratory social network analysis with Pajek},
	        author={De Nooy, Wouter and Mrvar, Andrej and Batagelj, Vladimir},
	        volume={27},
	        year={2011},
	        publisher={Cambridge University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebEpa",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-EPA graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-EPA graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@book{de2011exploratory,
        title={Exploratory social network analysis with Pajek},
        author={De Nooy, Wouter and Mrvar, Andrej and Batagelj, Vladimir},
        volume={27},
        year={2011},
        publisher={Cambridge University Press}
}
#   def Bcspwr02( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcspwr02(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcspwr02 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcspwr02 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcspwr02",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcspwr02 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcspwr02 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G31( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G31(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G31 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G31 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G31",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G31 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G31 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Chem97zt( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Chem97zt(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Chem97Zt graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Chem97Zt graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Chem97zt",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Chem97Zt graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Chem97Zt graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def TechInternetAs( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def TechInternetAs(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the tech-internet-as graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of tech-internet-as graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{rossi2013topology,
	        title={A Multi-Level Approach for Evaluating Internet Topology Generators},
	        author={Ryan A. Rossi and Sonia Fahmy and Nilothpal Talukder},
	        booktitle={Networking},
	        pages={1--9},
	        year={2013}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="TechInternetAs",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the tech-internet-as graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of tech-internet-as graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{rossi2013topology,
        title={A Multi-Level Approach for Evaluating Internet Topology Generators},
        author={Ryan A. Rossi and Sonia Fahmy and Nilothpal Talukder},
        booktitle={Networking},
        pages={1--9},
        year={2013}
}
#   def SocfbWake73( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbWake73(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Wake73 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Wake73 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbWake73",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Wake73 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Wake73 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Bfly( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bfly(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bfly graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bfly graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bfly",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bfly graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bfly graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def AvesWeaverSocial( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def AvesWeaverSocial(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the aves-weaver-social graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of aves-weaver-social graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="AvesWeaverSocial",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the aves-weaver-social graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of aves-weaver-social graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def DbpediaCountry( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def DbpediaCountry(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the dbpedia-country graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of dbpedia-country graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="DbpediaCountry",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the dbpedia-country graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of dbpedia-country graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Net25( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Net25(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the net25 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of net25 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Net25",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the net25 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of net25 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioHumanGene1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioHumanGene1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-human-gene1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-human-gene1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{bansal2007infer,
	        title={How to infer gene networks from expression profiles},
	        author={Bansal, Mukesh and Belcastro, Vincenzo and Ambesi-Impiombato, Alberto and Di Bernardo, Diego},
	        journal={Molecular systems biology},
	        volume={3},
	        number={1},
	        year={2007},
	        publisher={Wiley Online Library}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioHumanGene1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-human-gene1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-human-gene1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{bansal2007infer,
        title={How to infer gene networks from expression profiles},
        author={Bansal, Mukesh and Belcastro, Vincenzo and Ambesi-Impiombato, Alberto and Di Bernardo, Diego},
        journal={Molecular systems biology},
        volume={3},
        number={1},
        year={2007},
        publisher={Wiley Online Library}
}
#   def Cl1000002d1Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl1000002d1Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-100000-2d1-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-100000-2d1-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl1000002d1Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-100000-2d1-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-100000-2d1-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Bcsstk29( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcsstk29(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcsstk29 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcsstk29 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcsstk29",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcsstk29 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcsstk29 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioCePg( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioCePg(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-CE-PG graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-CE-PG graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{cho2014wormnet,
	        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
	        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
	        journal={Nucleic acids research},
	        volume={42},
	        number={W1},
	        pages={W76--W82},
	        year={2014},
	        publisher={Oxford University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioCePg",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-CE-PG graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-CE-PG graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{cho2014wormnet,
        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
        journal={Nucleic acids research},
        volume={42},
        number={W1},
        pages={W76--W82},
        year={2014},
        publisher={Oxford University Press}
}
#   def SocPokec( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocPokec(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-pokec graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-pokec graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{takac2012data,
	        title={Data analysis in public social networks},
	        author={Takac, Lubos and Zabovsky, Michal}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocPokec",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-pokec graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-pokec graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{takac2012data,
        title={Data analysis in public social networks},
        author={Takac, Lubos and Zabovsky, Michal}
}
#   def Us04( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Us04(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the us04 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of us04 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Us04",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the us04 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of us04 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw1000030d1Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000030d1Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-3-0d1-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-3-0d1-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000030d1Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-3-0d1-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-3-0d1-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Copter2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Copter2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the copter2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of copter2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Copter2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the copter2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of copter2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbMichigan23( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbMichigan23(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Michigan23 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Michigan23 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbMichigan23",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Michigan23 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Michigan23 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Brock2004( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Brock2004(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the brock200-4 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of brock200-4 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Brock2004",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the brock200-4 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of brock200-4 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Tf12( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Tf12(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the TF12 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of TF12 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Tf12",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the TF12 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of TF12 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def PHat15002( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def PHat15002(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the p-hat1500-2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of p-hat1500-2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="PHat15002",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the p-hat1500-2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of p-hat1500-2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def YoutubeGroupmemberships( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def YoutubeGroupmemberships(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the youtube-groupmemberships graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of youtube-groupmemberships graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="YoutubeGroupmemberships",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the youtube-groupmemberships graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of youtube-groupmemberships graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Connectus( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Connectus(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the connectus graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of connectus graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Connectus",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the connectus graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of connectus graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ig510( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ig510(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the IG5-10 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of IG5-10 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ig510",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the IG5-10 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of IG5-10 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def RoadGermanyOsm( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def RoadGermanyOsm(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the road-germany-osm graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of road-germany-osm graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="RoadGermanyOsm",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the road-germany-osm graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of road-germany-osm graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Rajat10( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Rajat10(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the rajat10 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of rajat10 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Rajat10",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the rajat10 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of rajat10 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioHsCx( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioHsCx(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-HS-CX graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-HS-CX graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{cho2014wormnet,
	        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
	        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
	        journal={Nucleic acids research},
	        volume={42},
	        number={W1},
	        pages={W76--W82},
	        year={2014},
	        publisher={Oxford University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioHsCx",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-HS-CX graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-HS-CX graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{cho2014wormnet,
        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
        journal={Nucleic acids research},
        volume={42},
        number={W1},
        pages={W76--W82},
        year={2014},
        publisher={Oxford University Press}
}
#   def EcoFoodwebBaywet( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def EcoFoodwebBaywet(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the eco-foodweb-baywet graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of eco-foodweb-baywet graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{ulanowicz1998network,
	        title={Network analysis of trophic dynamics in south florida ecosystems},
	        author={Ulanowicz, Robert E and DeAngelis, Donald L},
	        journal={FY97: The Florida Bay Ecosystem},
	        pages={20688--20038},
	        year={1998}
	}
	
	@article{melian2004food,
	        title={Food web cohesion},
	        author={Meli{\'a}n,
	Carlos J and Bascompte, Jordi},
	        journal={Ecology},
	        volume={85},
	        number={2},
	        pages={352--358},
	        year={2004},
	        publisher={Eco Soc America}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="EcoFoodwebBaywet",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the eco-foodweb-baywet graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of eco-foodweb-baywet graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{ulanowicz1998network,
        title={Network analysis of trophic dynamics in south florida ecosystems},
        author={Ulanowicz, Robert E and DeAngelis, Donald L},
        journal={FY97: The Florida Bay Ecosystem},
        pages={20688--20038},
        year={1998}
}

@article{melian2004food,
        title={Food web cohesion},
        author={Meli{'a}n,
Carlos J and Bascompte, Jordi},
        journal={Ecology},
        volume={85},
        number={2},
        pages={352--358},
        year={2004},
        publisher={Eco Soc America}
}
#   def Bas1lp( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bas1lp(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bas1lp graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bas1lp graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bas1lp",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bas1lp graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bas1lp graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ig59( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ig59(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the IG5-9 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of IG5-9 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ig59",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the IG5-9 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of IG5-9 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def RtRetweetCrawl( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def RtRetweetCrawl(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the rt-retweet-crawl graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of rt-retweet-crawl graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{rossi2012fastclique,
	        title={What if CLIQUE were fast? Maximum Cliques in Information Networks and Strong Components in Temporal Networks},
	        author={Ryan A. Rossi and David F. Gleich and Assefaw H. Gebremedhin and Mostofa A. Patwary},
	        journal={arXiv preprint arXiv:1210.5802},
	        pages={1--11},
	        year={2012}
	}
	
	@inproceedings{rossi2014pmc-www,
	        title={Fast Maximum Clique Algorithms for Large Graphs},
	        author={Ryan A. Rossi and David F. Gleich and Assefaw H. Gebremedhin and     Mostofa A. Patwary},
	        booktitle={Proceedings of the 23rd International Conference on World     Wide Web (WWW)},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="RtRetweetCrawl",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the rt-retweet-crawl graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of rt-retweet-crawl graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{rossi2012fastclique,
        title={What if CLIQUE were fast? Maximum Cliques in Information Networks and Strong Components in Temporal Networks},
        author={Ryan A. Rossi and David F. Gleich and Assefaw H. Gebremedhin and Mostofa A. Patwary},
        journal={arXiv preprint arXiv:1210.5802},
        pages={1--11},
        year={2012}
}

@inproceedings{rossi2014pmc-www,
        title={Fast Maximum Clique Algorithms for Large Graphs},
        author={Ryan A. Rossi and David F. Gleich and Assefaw H. Gebremedhin and     Mostofa A. Patwary},
        booktitle={Proceedings of the 23rd International Conference on World     Wide Web (WWW)},
        year={2014}
}
#   def SocfbWisconsin87( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbWisconsin87(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Wisconsin87 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Wisconsin87 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbWisconsin87",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Wisconsin87 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Wisconsin87 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Glossgt( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Glossgt(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the GlossGT graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of GlossGT graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Glossgt",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the GlossGT graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of GlossGT graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10001d7Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10001d7Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000-1d7-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000-1d7-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10001d7Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000-1d7-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000-1d7-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocGooglePlus( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocGooglePlus(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-google-plus graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-google-plus graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{Fire2013,
	        title={Computationally Efficient Link Prediction in Variety of Social Networks},
	        author={Fire, M., and Tenenboim, R., and Puzis, R., and Lesser, O., and Rokach, L., and Elovici, Y. },
	        journal={ACM Transactions on Intelligent Systems and Technology (TIST)},
	        volume={5},
	        number={1},
	        pages={10},
	        year={2013},
	        publisher={ACM}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocGooglePlus",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-google-plus graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-google-plus graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{Fire2013,
        title={Computationally Efficient Link Prediction in Variety of Social Networks},
        author={Fire, M., and Tenenboim, R., and Puzis, R., and Lesser, O., and Rokach, L., and Elovici, Y. },
        journal={ACM Transactions on Intelligent Systems and Technology (TIST)},
        volume={5},
        number={1},
        pages={10},
        year={2013},
        publisher={ACM}
}
#   def PHat10003( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def PHat10003(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the p-hat1000-3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of p-hat1000-3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="PHat10003",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the p-hat1000-3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of p-hat1000-3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Lshp2233( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Lshp2233(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the lshp2233 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of lshp2233 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Lshp2233",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the lshp2233 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of lshp2233 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Pfinan512( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pfinan512(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the pfinan512 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of pfinan512 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pfinan512",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the pfinan512 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of pfinan512 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def MaayanFaa( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def MaayanFaa(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the maayan-faa graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of maayan-faa graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="MaayanFaa",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the maayan-faa graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of maayan-faa graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def RoadnetTx( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def RoadnetTx(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the roadNet-TX graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of roadNet-TX graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="RoadnetTx",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the roadNet-TX graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of roadNet-TX graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100050d3Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100050d3Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-5-0d3-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-5-0d3-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100050d3Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-5-0d3-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-5-0d3-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CaAminer( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CaAminer(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ca-aminer graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ca-aminer graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CaAminer",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ca-aminer graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ca-aminer graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbTexas80( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbTexas80(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Texas80 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Texas80 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbTexas80",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Texas80 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Texas80 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Sw100030d2Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100030d2Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-3-0d2-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-3-0d2-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100030d2Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-3-0d2-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-3-0d2-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def ZhishiBaiduRelatedpages( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def ZhishiBaiduRelatedpages(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the zhishi-baidu-relatedpages graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of zhishi-baidu-relatedpages graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="ZhishiBaiduRelatedpages",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the zhishi-baidu-relatedpages graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of zhishi-baidu-relatedpages graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WbCsStanford( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WbCsStanford(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the wb-cs-stanford graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of wb-cs-stanford graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WbCsStanford",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the wb-cs-stanford graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of wb-cs-stanford graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Jagmesh6( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Jagmesh6(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the jagmesh6 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of jagmesh6 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Jagmesh6",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the jagmesh6 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of jagmesh6 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100030d1Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100030d1Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-3-0d1-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-3-0d1-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100030d1Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-3-0d1-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-3-0d1-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def P2pGnutella31( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def P2pGnutella31(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the p2p-Gnutella31 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of p2p-Gnutella31 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="P2pGnutella31",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the p2p-Gnutella31 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of p2p-Gnutella31 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Reactome( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Reactome(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the reactome graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of reactome graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Reactome",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the reactome graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of reactome graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Github( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Github(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the github graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of github graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Github",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the github graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of github graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbBerkeley13( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbBerkeley13(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Berkeley13 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Berkeley13 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbBerkeley13",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Berkeley13 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Berkeley13 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def ZhishiHudongRelatedpages( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def ZhishiHudongRelatedpages(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the zhishi-hudong-relatedpages graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of zhishi-hudong-relatedpages graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="ZhishiHudongRelatedpages",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the zhishi-hudong-relatedpages graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of zhishi-hudong-relatedpages graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Trec8( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Trec8(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Trec8 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Trec8 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Trec8",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Trec8 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Trec8 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def San400072( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def San400072(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the san400-0-7-2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of san400-0-7-2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="San400072",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the san400-0-7-2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of san400-0-7-2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def WebItalycnr2000( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebItalycnr2000(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-italycnr-2000 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-italycnr-2000 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@ARTICLE{boldi2004-ubicrawler,
	        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
	        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
	        journal = {Software: Practice \& Experience},
	        year = {2004},
	        volume = {34},
	        pages = {711--726},
	        number = {8}}
	
	@INPROCEEDINGS{Boldi-2011-layered,
	        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
	        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering	for Compressing Social Networks},
	        booktitle = {WWW},
	        year = {2011},
	        pages = {587--596}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebItalycnr2000",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-italycnr-2000 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-italycnr-2000 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@ARTICLE{boldi2004-ubicrawler,
        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
        journal = {Software: Practice \& Experience},
        year = {2004},
        volume = {34},
        pages = {711--726},
        number = {8}}

@INPROCEEDINGS{Boldi-2011-layered,
        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering  for Compressing Social Networks},
        booktitle = {WWW},
        year = {2011},
        pages = {587--596}
}
#   def WebStanford( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebStanford(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-Stanford graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-Stanford graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebStanford",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-Stanford graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-Stanford graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WebIndochina2004( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebIndochina2004(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-indochina-2004 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-indochina-2004 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@ARTICLE{boldi2004-ubicrawler,
	        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
	        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
	        journal = {Software: Practice \& Experience},
	        year = {2004},
	        volume = {34},
	        pages = {711--726},
	        number = {8}}
	
	@INPROCEEDINGS{Boldi-2011-layered,
	        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
	        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering	for Compressing Social Networks},
	        booktitle = {WWW},
	        year = {2011},
	        pages = {587--596}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebIndochina2004",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-indochina-2004 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-indochina-2004 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@ARTICLE{boldi2004-ubicrawler,
        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
        journal = {Software: Practice \& Experience},
        year = {2004},
        volume = {34},
        pages = {711--726},
        number = {8}}

@INPROCEEDINGS{Boldi-2011-layered,
        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering  for Compressing Social Networks},
        booktitle = {WWW},
        year = {2011},
        pages = {587--596}
}
#   def SocfbNortheastern19( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbNortheastern19(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Northeastern19 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Northeastern19 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbNortheastern19",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Northeastern19 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Northeastern19 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Stanford( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Stanford(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Stanford graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Stanford graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Stanford",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Stanford graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Stanford graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CFat5001( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CFat5001(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the c-fat500-1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of c-fat500-1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CFat5001",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the c-fat500-1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of c-fat500-1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def SocSignBitcoinotc( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocSignBitcoinotc(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-sign-bitcoinotc graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-sign-bitcoinotc graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocSignBitcoinotc",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-sign-bitcoinotc graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-sign-bitcoinotc graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Flickr( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Flickr(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the flickr graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of flickr graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Flickr",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the flickr graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of flickr graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G38( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G38(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G38 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G38 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G38",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G38 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G38 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw1000050d3Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000050d3Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-5-0d3-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-5-0d3-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000050d3Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-5-0d3-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-5-0d3-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G5( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G5(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G5 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G5 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G5",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G5 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G5 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def ScShipsec1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def ScShipsec1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the sc-shipsec1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of sc-shipsec1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="ScShipsec1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the sc-shipsec1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of sc-shipsec1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}
#   def SocfbColgate88( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbColgate88(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Colgate88 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Colgate88 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbColgate88",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Colgate88 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Colgate88 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Arabic2005( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Arabic2005(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the arabic-2005 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of arabic-2005 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Arabic2005",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the arabic-2005 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of arabic-2005 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ccc( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ccc(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ccc graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ccc graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ccc",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ccc graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ccc graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Barth4( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Barth4(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the barth4 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of barth4 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Barth4",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the barth4 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of barth4 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def C20009( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def C20009(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the C2000-9 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of C2000-9 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="C20009",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the C2000-9 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of C2000-9 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def SocLastfm( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocLastfm(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-lastfm graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-lastfm graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{konstas2009social,
	        title={On social networks and collaborative recommendation},
	        author={Konstas, Ioannis and Stathopoulos, Vassilios and Jose, Joemon M},
	        booktitle={Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval},
	        pages={195--202},
	        year={2009},
	        organization={ACM}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocLastfm",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-lastfm graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-lastfm graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{konstas2009social,
        title={On social networks and collaborative recommendation},
        author={Konstas, Ioannis and Stathopoulos, Vassilios and Jose, Joemon M},
        booktitle={Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval},
        pages={195--202},
        year={2009},
        organization={ACM}
}
#   def Trec11( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Trec11(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Trec11 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Trec11 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Trec11",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Trec11 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Trec11 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocBuzznet( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocBuzznet(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-buzznet graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-buzznet graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{Shakarian:2012,
	        author = {Shakarian, Paulo and Paulo, Damon},
	        title = {Large Social Networks Can Be Targeted for Viral Marketing with Small Seed Sets},
	        booktitle = {Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)},
	        year = {2012},
	        pages = {1--8},
	        publisher = {IEEE Computer Society}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocBuzznet",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-buzznet graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-buzznet graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{Shakarian:2012,
        author = {Shakarian, Paulo and Paulo, Damon},
        title = {Large Social Networks Can Be Targeted for Viral Marketing with Small Seed Sets},
        booktitle = {Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)},
        year = {2012},
        pages = {1--8},
        publisher = {IEEE Computer Society}
}
#   def Usroads48( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Usroads48(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the usroads-48 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of usroads-48 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Usroads48",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the usroads-48 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of usroads-48 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioGridWorm( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioGridWorm(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-grid-worm graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-grid-worm graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioGridWorm",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-grid-worm graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-grid-worm graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100040d3Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100040d3Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-4-0d3-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-4-0d3-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100040d3Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-4-0d3-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-4-0d3-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbNotredame57( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbNotredame57(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-NotreDame57 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-NotreDame57 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbNotredame57",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-NotreDame57 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-NotreDame57 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Epa( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Epa(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the EPA graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of EPA graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Epa",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the EPA graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of EPA graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def ErMd( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def ErMd(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ER-MD graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ER-MD graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="ErMd",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ER-MD graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ER-MD graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G17( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G17(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G17 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G17 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G17",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G17 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G17 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbIndiana69( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbIndiana69(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Indiana69 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Indiana69 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbIndiana69",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Indiana69 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Indiana69 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Cvxbqp1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cvxbqp1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cvxbqp1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cvxbqp1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cvxbqp1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cvxbqp1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cvxbqp1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw1000060d1Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000060d1Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-6-0d1-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-6-0d1-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000060d1Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-6-0d1-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-6-0d1-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Hugebubbles00010( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Hugebubbles00010(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the hugebubbles-00010 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of hugebubbles-00010 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Hugebubbles00010",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the hugebubbles-00010 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of hugebubbles-00010 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw10040d1Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10040d1Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-4-0d1-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-4-0d1-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10040d1Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-4-0d1-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-4-0d1-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Hugebubbles00000( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Hugebubbles00000(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the hugebubbles-00000 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of hugebubbles-00000 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Hugebubbles00000",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the hugebubbles-00000 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of hugebubbles-00000 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbColumbia2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbColumbia2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Columbia2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Columbia2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbColumbia2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Columbia2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Columbia2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Cage15( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cage15(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cage15 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cage15 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cage15",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cage15 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cage15 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw1000060d2Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000060d2Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-6-0d2-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-6-0d2-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000060d2Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-6-0d2-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-6-0d2-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def RoadUsroads( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def RoadUsroads(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the road-usroads graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of road-usroads graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="RoadUsroads",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the road-usroads graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of road-usroads graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocAcademia( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocAcademia(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-academia graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-academia graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{Fire2011,
	        title={Link Prediction in Social Networks using Computationally Efficient Topological Features},
	        author={Fire, M. and Tenenboim, L. and Lesser, O. and Puzis, R. and Rokach, L. and Elovici, Y.},
	        booktitle={ IEEE Third International Confernece on Social Computing (SocialCom)},
	        pages={73--80},
	        year={2011},
	        organization={IEEE}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocAcademia",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-academia graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-academia graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{Fire2011,
        title={Link Prediction in Social Networks using Computationally Efficient Topological Features},
        author={Fire, M. and Tenenboim, L. and Lesser, O. and Puzis, R. and Rokach, L. and Elovici, Y.},
        booktitle={ IEEE Third International Confernece on Social Computing (SocialCom)},
        pages={73--80},
        year={2011},
        organization={IEEE}
}
#   def Sw10040d2Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10040d2Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-4-0d2-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-4-0d2-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10040d2Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-4-0d2-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-4-0d2-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Karate( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Karate(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the karate graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of karate graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Karate",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the karate graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of karate graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw10030d3Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10030d3Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-3-0d3-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-3-0d3-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10030d3Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-3-0d3-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-3-0d3-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sanr20009( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sanr20009(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the sanr200-0-9 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of sanr200-0-9 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sanr20009",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the sanr200-0-9 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of sanr200-0-9 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Bcsstk30( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcsstk30(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcsstk30 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcsstk30 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcsstk30",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcsstk30 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcsstk30 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10m1d8L5( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10m1d8L5(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-10M-1d8-L5 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-10M-1d8-L5 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10m1d8L5",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-10M-1d8-L5 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-10M-1d8-L5 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WordnetWords( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WordnetWords(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the wordnet-words graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of wordnet-words graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WordnetWords",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the wordnet-words graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of wordnet-words graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def MiscFootball( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def MiscFootball(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the misc-football graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of misc-football graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{girvan2002community,
	        title={Community structure in social and biological networks},
	        author={Girvan, Michelle and Newman, Mark EJ},
	        journal={Proceedings of the National Academy of Sciences},
	        volume={99},
	        number={12},
	        pages={7821--7826},
	        year={2002},
	        publisher={National Acad Sciences}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="MiscFootball",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the misc-football graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of misc-football graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{girvan2002community,
        title={Community structure in social and biological networks},
        author={Girvan, Michelle and Newman, Mark EJ},
        journal={Proceedings of the National Academy of Sciences},
        volume={99},
        number={12},
        pages={7821--7826},
        year={2002},
        publisher={National Acad Sciences}
}
#   def EgoGplus( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def EgoGplus(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ego-gplus graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ego-gplus graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="EgoGplus",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ego-gplus graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ego-gplus graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbUnc28( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUnc28(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-UNC28 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-UNC28 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUnc28",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-UNC28 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-UNC28 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def WebEdu( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebEdu(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-edu graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-edu graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{gleich2004fast,
	        title={Fast parallel PageRank: A linear system approach},
	        author={Gleich, David and Zhukov, Leonid and Berkhin, Pavel},
	        journal={Yahoo! Research Technical Report YRL-2004-038},
	        volume={13},
	        pages={22},
	        year={2004}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebEdu",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-edu graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-edu graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{gleich2004fast,
        title={Fast parallel PageRank: A linear system approach},
        author={Gleich, David and Zhukov, Leonid and Berkhin, Pavel},
        journal={Yahoo! Research Technical Report YRL-2004-038},
        volume={13},
        pages={22},
        year={2004}
}
#   def CaGrqc( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CaGrqc(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ca-GrQc graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ca-GrQc graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CaGrqc",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ca-GrQc graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ca-GrQc graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioWormnetV3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioWormnetV3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-WormNet-v3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-WormNet-v3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{cho2014wormnet,
	        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
	        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
	        journal={Nucleic acids research},
	        volume={42},
	        number={W1},
	        pages={W76--W82},
	        year={2014},
	        publisher={Oxford University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioWormnetV3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-WormNet-v3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-WormNet-v3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{cho2014wormnet,
        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
        journal={Nucleic acids research},
        volume={42},
        number={W1},
        pages={W76--W82},
        year={2014},
        publisher={Oxford University Press}
}
#   def Mri1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Mri1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the mri1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of mri1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Mri1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the mri1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of mri1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Rajat09( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Rajat09(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the rajat09 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of rajat09 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Rajat09",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the rajat09 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of rajat09 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G65( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G65(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G65 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G65 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G65",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G65 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G65 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Grid1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Grid1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the grid1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of grid1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Grid1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the grid1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of grid1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Hamming62( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Hamming62(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the hamming6-2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of hamming6-2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Hamming62",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the hamming6-2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of hamming6-2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Gearbox( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Gearbox(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the gearbox graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of gearbox graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Gearbox",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the gearbox graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of gearbox graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Bcsstm23( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcsstm23(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcsstm23 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcsstm23 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcsstm23",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcsstm23 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcsstm23 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def TechAsCaida20071105( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def TechAsCaida20071105(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the tech-as-caida20071105 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of tech-as-caida20071105 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="TechAsCaida20071105",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the tech-as-caida20071105 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of tech-as-caida20071105 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WebBerkstanDir( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebBerkstanDir(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-BerkStan-dir graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-BerkStan-dir graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{leskovec2008statistical,
	        title={Statistical properties of community structure in large social and information networks},
	        author={Leskovec, Jure and Lang, Kevin J and Dasgupta, Anirban and Mahoney, Michael W},
	        booktitle={Proceedings of the 17th international conference on World Wide Web},
	        pages={695--704},
	        year={2008},
	        organization={ACM}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebBerkstanDir",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-BerkStan-dir graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-BerkStan-dir graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{leskovec2008statistical,
        title={Statistical properties of community structure in large social and information networks},
        author={Leskovec, Jure and Lang, Kevin J and Dasgupta, Anirban and Mahoney, Michael W},
        booktitle={Proceedings of the 17th international conference on World Wide Web},
        pages={695--704},
        year={2008},
        organization={ACM}
}
#   def SocPokecRelationships( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocPokecRelationships(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-pokec-relationships graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-pokec-relationships graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocPokecRelationships",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-pokec-relationships graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-pokec-relationships graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocAdvogato( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocAdvogato(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-advogato graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-advogato graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{massa2009bowling,
	        title={Bowling alone and trust decline in social network sites},
	        author={Massa, Paolo and Salvetti, Martino and Tomasoni, Danilo},
	        booktitle={Dependable, Autonomic and Secure Computing, 2009. DASC'09. Eighth IEEE International Conference on},
	        pages={658--663},
	        year={2009},
	        organization={IEEE}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocAdvogato",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-advogato graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-advogato graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{massa2009bowling,
        title={Bowling alone and trust decline in social network sites},
        author={Massa, Paolo and Salvetti, Martino and Tomasoni, Danilo},
        booktitle={Dependable, Autonomic and Secure Computing, 2009. DASC'09. Eighth IEEE International Conference on},
        pages={658--663},
        year={2009},
        organization={IEEE}
}
#   def RoadGreatBritainOsm( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def RoadGreatBritainOsm(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the road-great-britain-osm graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of road-great-britain-osm graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="RoadGreatBritainOsm",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the road-great-britain-osm graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of road-great-britain-osm graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Brock8004( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Brock8004(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the brock800-4 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of brock800-4 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Brock8004",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the brock800-4 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of brock800-4 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def SocfbStanford3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbStanford3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Stanford3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Stanford3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbStanford3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Stanford3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Stanford3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def RoadMinnesota( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def RoadMinnesota(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the road-minnesota graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of road-minnesota graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="RoadMinnesota",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the road-minnesota graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of road-minnesota graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WebSpamDetection( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebSpamDetection(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-spam-detection graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-spam-detection graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebSpamDetection",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-spam-detection graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-spam-detection graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Bcspwr10( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcspwr10(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcspwr10 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcspwr10 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcspwr10",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcspwr10 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcspwr10 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G23( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G23(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G23 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G23 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G23",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G23 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G23 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def ScPkustk13( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def ScPkustk13(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the sc-pkustk13 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of sc-pkustk13 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="ScPkustk13",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the sc-pkustk13 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of sc-pkustk13 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}
#   def Chem97ztz( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Chem97ztz(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Chem97ZtZ graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Chem97ZtZ graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Chem97ztz",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Chem97ZtZ graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Chem97ZtZ graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def EcoEverglades( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def EcoEverglades(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the eco-everglades graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of eco-everglades graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{ulanowicz1998network,
	        title={Network analysis of trophic dynamics in south florida ecosystems},
	        author={Ulanowicz, Robert E and DeAngelis, Donald L},
	        journal={FY97: The Florida Bay Ecosystem},
	        pages={20688--20038},
	        year={1998}
	}
	
	@article{melian2004food,
	        title={Food web cohesion},
	        author={Meli{\'a}n,
	Carlos J and Bascompte, Jordi},
	        journal={Ecology},
	        volume={85},
	        number={2},
	        pages={352--358},
	        year={2004},
	        publisher={Eco Soc America}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="EcoEverglades",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the eco-everglades graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of eco-everglades graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{ulanowicz1998network,
        title={Network analysis of trophic dynamics in south florida ecosystems},
        author={Ulanowicz, Robert E and DeAngelis, Donald L},
        journal={FY97: The Florida Bay Ecosystem},
        pages={20688--20038},
        year={1998}
}

@article{melian2004food,
        title={Food web cohesion},
        author={Meli{'a}n,
Carlos J and Bascompte, Jordi},
        journal={Ecology},
        volume={85},
        number={2},
        pages={352--358},
        year={2004},
        publisher={Eco Soc America}
}
#   def SocfbKonect( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbKonect(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-konect graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-konect graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbKonect",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-konect graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-konect graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Sphere3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sphere3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the sphere3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of sphere3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sphere3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the sphere3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of sphere3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def EmailUniv( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def EmailUniv(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the email-univ graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of email-univ graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="EmailUniv",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the email-univ graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of email-univ graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def AsCaida20071105( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def AsCaida20071105(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the as-caida20071105 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of as-caida20071105 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="AsCaida20071105",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the as-caida20071105 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of as-caida20071105 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10000002d0Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10000002d0Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000000-2d0-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000000-2d0-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10000002d0Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000000-2d0-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000000-2d0-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100060d1Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100060d1Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-6-0d1-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-6-0d1-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100060d1Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-6-0d1-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-6-0d1-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Lshp1270( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Lshp1270(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the lshp1270 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of lshp1270 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Lshp1270",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the lshp1270 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of lshp1270 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G51( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G51(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G51 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G51 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G51",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G51 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G51 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100060d2Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100060d2Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-6-0d2-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-6-0d2-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100060d2Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-6-0d2-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-6-0d2-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def PetsterCarnivore( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def PetsterCarnivore(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the petster-carnivore graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of petster-carnivore graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="PetsterCarnivore",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the petster-carnivore graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of petster-carnivore graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G41( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G41(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G41 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G41 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G41",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G41 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G41 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Pkustk07( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pkustk07(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the pkustk07 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of pkustk07 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pkustk07",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the pkustk07 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of pkustk07 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw10050d1Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10050d1Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-5-0d1-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-5-0d1-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10050d1Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-5-0d1-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-5-0d1-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def DbpediaOccupation( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def DbpediaOccupation(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the dbpedia-occupation graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of dbpedia-occupation graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="DbpediaOccupation",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the dbpedia-occupation graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of dbpedia-occupation graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbMaine59( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbMaine59(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Maine59 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Maine59 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbMaine59",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Maine59 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Maine59 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def SocfbUillinois20( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUillinois20(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-UIllinois20 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-UIllinois20 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUillinois20",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-UIllinois20 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-UIllinois20 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def SocfbCarnegie49( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbCarnegie49(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Carnegie49 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Carnegie49 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbCarnegie49",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Carnegie49 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Carnegie49 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def TechP2p( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def TechP2p(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the tech-p2p graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of tech-p2p graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{opsahl2009clustering,
	        title={Clustering in weighted networks},
	        author={Opsahl, Tore and Panzarasa, Pietro},
	        journal={Social networks},
	        volume={31},
	        number={2},
	        pages={155--163},
	        year={2009},
	        publisher={Elsevier}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="TechP2p",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the tech-p2p graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of tech-p2p graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{opsahl2009clustering,
        title={Clustering in weighted networks},
        author={Opsahl, Tore and Panzarasa, Pietro},
        journal={Social networks},
        volume={31},
        number={2},
        pages={155--163},
        year={2009},
        publisher={Elsevier}
}
#   def Sw10050d2Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10050d2Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-5-0d2-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-5-0d2-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10050d2Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-5-0d2-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-5-0d2-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Football( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Football(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the football graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of football graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Football",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the football graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of football graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def PHat10001( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def PHat10001(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the p-hat1000-1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of p-hat1000-1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="PHat10001",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the p-hat1000-1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of p-hat1000-1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Sw1000040d3Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000040d3Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-4-0d3-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-4-0d3-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000040d3Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-4-0d3-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-4-0d3-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def C10009( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def C10009(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the C1000-9 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of C1000-9 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="C10009",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the C1000-9 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of C1000-9 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Sw10060d3Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10060d3Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-6-0d3-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-6-0d3-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10060d3Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-6-0d3-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-6-0d3-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Erdos991( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Erdos991(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Erdos991 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Erdos991 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Erdos991",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Erdos991 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Erdos991 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Dd199( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Dd199(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the DD199 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of DD199 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Dd199",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the DD199 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of DD199 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WebWikipedia2009( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebWikipedia2009(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-wikipedia2009 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-wikipedia2009 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{wikipedia2009,
	        title={Wikipedia Database dump},
	        author={Various},
	        year={2009},
	        note={Version from 2009-03-06. http://en.wikipedia.org/wiki/Wikipedia:Database_download}
	}
	
	@article{rossi2012dynamical,
	        title={A Dynamical System for PageRank with Time-Dependent Teleportation},
	        author={David F. Gleich and Ryan A. Rossi},
	        journal={Internet Mathematics},
	        pages={1--30},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebWikipedia2009",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-wikipedia2009 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-wikipedia2009 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{wikipedia2009,
        title={Wikipedia Database dump},
        author={Various},
        year={2009},
        note={Version from 2009-03-06. http://en.wikipedia.org/wiki/Wikipedia:Database_download}
}

@article{rossi2012dynamical,
        title={A Dynamical System for PageRank with Time-Dependent Teleportation},
        author={David F. Gleich and Ryan A. Rossi},
        journal={Internet Mathematics},
        pages={1--30},
        year={2014}
}
#   def Erdos981( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Erdos981(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Erdos981 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Erdos981 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Erdos981",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Erdos981 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Erdos981 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WebUk2005( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebUk2005(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-uk-2005 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-uk-2005 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@ARTICLE{boldi2004-ubicrawler,
	        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
	        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
	        journal = {Software: Practice \& Experience},
	        year = {2004},
	        volume = {34},
	        pages = {711--726},
	        number = {8}}
	
	@INPROCEEDINGS{Boldi-2011-layered,
	        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
	        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering	for Compressing Social Networks},
	        booktitle = {WWW},
	        year = {2011},
	        pages = {587--596}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebUk2005",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-uk-2005 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-uk-2005 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@ARTICLE{boldi2004-ubicrawler,
        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
        journal = {Software: Practice \& Experience},
        year = {2004},
        volume = {34},
        pages = {711--726},
        number = {8}}

@INPROCEEDINGS{Boldi-2011-layered,
        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering  for Compressing Social Networks},
        booktitle = {WWW},
        year = {2011},
        pages = {587--596}
}
#   def SocfbBaylor93( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbBaylor93(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Baylor93 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Baylor93 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbBaylor93",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Baylor93 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Baylor93 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Fe4elt2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Fe4elt2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the fe-4elt2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of fe-4elt2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Fe4elt2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the fe-4elt2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of fe-4elt2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}
#   def Abb313( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Abb313(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the abb313 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of abb313 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Abb313",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the abb313 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of abb313 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def TrecWt10g( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def TrecWt10g(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the trec-wt10g graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of trec-wt10g graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="TrecWt10g",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the trec-wt10g graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of trec-wt10g graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbReed98( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbReed98(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Reed98 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Reed98 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbReed98",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Reed98 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Reed98 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Sw100050d3Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100050d3Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-5-0d3-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-5-0d3-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100050d3Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-5-0d3-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-5-0d3-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbNyu9( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbNyu9(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-NYU9 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-NYU9 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbNyu9",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-NYU9 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-NYU9 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def P2pGnutella05( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def P2pGnutella05(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the p2p-Gnutella05 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of p2p-Gnutella05 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="P2pGnutella05",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the p2p-Gnutella05 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of p2p-Gnutella05 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def EcoFoodwebBaydry( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def EcoFoodwebBaydry(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the eco-foodweb-baydry graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of eco-foodweb-baydry graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{ulanowicz1998network,
	        title={Network analysis of trophic dynamics in south florida ecosystems},
	        author={Ulanowicz, Robert E and DeAngelis, Donald L},
	        journal={FY97: The Florida Bay Ecosystem},
	        pages={20688--20038},
	        year={1998}
	}
	
	@article{melian2004food,
	        title={Food web cohesion},
	        author={Meli{\'a}n,
	Carlos J and Bascompte, Jordi},
	        journal={Ecology},
	        volume={85},
	        number={2},
	        pages={352--358},
	        year={2004},
	        publisher={Eco Soc America}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="EcoFoodwebBaydry",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the eco-foodweb-baydry graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of eco-foodweb-baydry graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{ulanowicz1998network,
        title={Network analysis of trophic dynamics in south florida ecosystems},
        author={Ulanowicz, Robert E and DeAngelis, Donald L},
        journal={FY97: The Florida Bay Ecosystem},
        pages={20688--20038},
        year={1998}
}

@article{melian2004food,
        title={Food web cohesion},
        author={Meli{'a}n,
Carlos J and Bascompte, Jordi},
        journal={Ecology},
        volume={85},
        number={2},
        pages={352--358},
        year={2004},
        publisher={Eco Soc America}
}
#   def Gupta2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Gupta2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the gupta2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of gupta2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Gupta2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the gupta2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of gupta2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def San200071( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def San200071(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the san200-0-7-1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of san200-0-7-1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="San200071",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the san200-0-7-1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of san200-0-7-1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Advogato( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Advogato(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the advogato graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of advogato graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Advogato",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the advogato graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of advogato graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbBu10( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbBu10(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-BU10 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-BU10 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbBu10",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-BU10 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-BU10 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def CaCoauthorsDblp( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CaCoauthorsDblp(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ca-coauthors-dblp graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ca-coauthors-dblp graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CaCoauthorsDblp",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ca-coauthors-dblp graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ca-coauthors-dblp graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}
#   def CFat2001( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CFat2001(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the c-fat200-1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of c-fat200-1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CFat2001",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the c-fat200-1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of c-fat200-1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def RtTwitterCopen( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def RtTwitterCopen(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the rt-twitter-copen graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of rt-twitter-copen graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{ahmed2010time,
	        title={Time-based sampling of social network activity graphs},
	        author={Ahmed, N.K. and Berchmans, F. and Neville, J. and Kompella, R.},
	        booktitle={SIGKDD MLG},
	        pages={1--9},
	        year={2010},
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="RtTwitterCopen",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the rt-twitter-copen graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of rt-twitter-copen graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{ahmed2010time,
        title={Time-based sampling of social network activity graphs},
        author={Ahmed, N.K. and Berchmans, F. and Neville, J. and Kompella, R.},
        booktitle={SIGKDD MLG},
        pages={1--9},
        year={2010},
}
#   def RoadItalyOsm( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def RoadItalyOsm(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the road-italy-osm graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of road-italy-osm graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="RoadItalyOsm",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the road-italy-osm graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of road-italy-osm graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioGridFruitfly( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioGridFruitfly(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-grid-fruitfly graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-grid-fruitfly graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioGridFruitfly",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-grid-fruitfly graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-grid-fruitfly graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbDuke14( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbDuke14(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Duke14 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Duke14 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbDuke14",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Duke14 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Duke14 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Sw1000030d2Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000030d2Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-3-0d2-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-3-0d2-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000030d2Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-3-0d2-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-3-0d2-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Rajat02( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Rajat02(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the rajat02 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of rajat02 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Rajat02",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the rajat02 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of rajat02 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ig512( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ig512(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the IG5-12 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of IG5-12 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ig512",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the IG5-12 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of IG5-12 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def OpsahlUsairport( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def OpsahlUsairport(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the opsahl-usairport graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of opsahl-usairport graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="OpsahlUsairport",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the opsahl-usairport graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of opsahl-usairport graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbUsf51( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUsf51(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-USF51 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-USF51 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUsf51",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-USF51 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-USF51 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def SocGplus( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocGplus(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-gplus graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-gplus graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocGplus",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-gplus graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-gplus graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Tf10( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Tf10(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the TF10 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of TF10 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Tf10",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the TF10 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of TF10 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Troll( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Troll(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the troll graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of troll graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Troll",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the troll graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of troll graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10000001d8Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10000001d8Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000000-1d8-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000000-1d8-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10000001d8Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000000-1d8-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000000-1d8-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def TechPgp( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def TechPgp(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the tech-pgp graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of tech-pgp graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{boguna2004models,
	        title={Models of social networks based on social distance attachment},
	        author={Bogu{\~n}{\'a},
	Mari{\'a}n and Pastor-Satorras,
	Romualdo and D{\'\i}az-Guilera,
	Albert and Arenas, Alex},
	        journal={Physical Review E},
	        volume={70},
	        number={5},
	        pages={056122},
	        year={2004},
	        publisher={APS}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="TechPgp",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the tech-pgp graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of tech-pgp graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{boguna2004models,
        title={Models of social networks based on social distance attachment},
        author={Bogu{\~n}{'a},
Mari{'a}n and Pastor-Satorras,
Romualdo and D{'\i}az-Guilera,
Albert and Arenas, Alex},
        journal={Physical Review E},
        volume={70},
        number={5},
        pages={056122},
        year={2004},
        publisher={APS}
}
#   def Sw1000030d1Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000030d1Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-3-0d1-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-3-0d1-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000030d1Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-3-0d1-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-3-0d1-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CopresenceInvs15( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CopresenceInvs15(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the copresence-InVS15 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of copresence-InVS15 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{infect,
	        author={{SocioPatterns}},
	        title={Infectious contact networks},
	        url={http://www.sociopatterns.org/datasets/}}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CopresenceInvs15",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the copresence-InVS15 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of copresence-InVS15 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{infect,
        author={{SocioPatterns}},
        title={Infectious contact networks},
        url={http://www.sociopatterns.org/datasets/}}
#   def Trec13( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Trec13(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Trec13 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Trec13 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Trec13",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Trec13 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Trec13 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WebGoogleDir( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebGoogleDir(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-google-dir graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-google-dir graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{leskovec2009community,
	        title={Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters},
	        author={Leskovec, Jure and Lang, Kevin J and Dasgupta, Anirban and Mahoney, Michael W},
	        journal={Internet Mathematics},
	        volume={6},
	        number={1},
	        pages={29--123},
	        year={2009},
	        publisher={Taylor \& Francis}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebGoogleDir",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-google-dir graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-google-dir graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{leskovec2009community,
        title={Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters},
        author={Leskovec, Jure and Lang, Kevin J and Dasgupta, Anirban and Mahoney, Michael W},
        journal={Internet Mathematics},
        volume={6},
        number={1},
        pages={29--123},
        year={2009},
        publisher={Taylor \& Francis}
}
#   def AsCaida( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def AsCaida(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the as-caida graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of as-caida graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="AsCaida",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the as-caida graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of as-caida graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cca( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cca(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cca graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cca graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cca",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cca graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cca graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def FeTooth( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def FeTooth(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the fe-tooth graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of fe-tooth graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="FeTooth",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the fe-tooth graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of fe-tooth graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}
#   def Sw1000050d3Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000050d3Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-5-0d3-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-5-0d3-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000050d3Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-5-0d3-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-5-0d3-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G7( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G7(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G7 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G7 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G7",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G7 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G7 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G48( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G48(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G48 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G48 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G48",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G48 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G48 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbOr( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbOr(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-OR graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-OR graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbOr",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-OR graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-OR graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def SocfbUc61( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUc61(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-UC61 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-UC61 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUc61",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-UC61 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-UC61 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def G58( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G58(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G58 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G58 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G58",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G58 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G58 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CaAstroph( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CaAstroph(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ca-AstroPh graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ca-AstroPh graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CaAstroph",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ca-AstroPh graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ca-AstroPh graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl1000001d7Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl1000001d7Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-100000-1d7-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-100000-1d7-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl1000001d7Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-100000-1d7-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-100000-1d7-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioDmHt( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioDmHt(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-DM-HT graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-DM-HT graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{cho2014wormnet,
	        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
	        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
	        journal={Nucleic acids research},
	        volume={42},
	        number={W1},
	        pages={W76--W82},
	        year={2014},
	        publisher={Oxford University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioDmHt",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-DM-HT graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-DM-HT graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{cho2014wormnet,
        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
        journal={Nucleic acids research},
        volume={42},
        number={W1},
        pages={W76--W82},
        year={2014},
        publisher={Oxford University Press}
}
#   def SocfbUpenn7( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUpenn7(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-UPenn7 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-UPenn7 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUpenn7",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-UPenn7 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-UPenn7 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def EmailEu( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def EmailEu(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the email-EU graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of email-EU graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="EmailEu",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the email-EU graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of email-EU graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def EcoFlorida( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def EcoFlorida(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the eco-florida graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of eco-florida graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{ulanowicz1998network,
	        title={Network analysis of trophic dynamics in south florida ecosystems},
	        author={Ulanowicz, Robert E and DeAngelis, Donald L},
	        journal={FY97: The Florida Bay Ecosystem},
	        pages={20688--20038},
	        year={1998}
	}
	
	@article{melian2004food,
	        title={Food web cohesion},
	        author={Meli{\'a}n,
	Carlos J and Bascompte, Jordi},
	        journal={Ecology},
	        volume={85},
	        number={2},
	        pages={352--358},
	        year={2004},
	        publisher={Eco Soc America}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="EcoFlorida",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the eco-florida graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of eco-florida graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{ulanowicz1998network,
        title={Network analysis of trophic dynamics in south florida ecosystems},
        author={Ulanowicz, Robert E and DeAngelis, Donald L},
        journal={FY97: The Florida Bay Ecosystem},
        pages={20688--20038},
        year={1998}
}

@article{melian2004food,
        title={Food web cohesion},
        author={Meli{'a}n,
Carlos J and Bascompte, Jordi},
        journal={Ecology},
        volume={85},
        number={2},
        pages={352--358},
        year={2004},
        publisher={Eco Soc America}
}
#   def Cage9( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cage9(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cage9 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cage9 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cage9",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cage9 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cage9 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl100001d8Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl100001d8Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-10000-1d8-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-10000-1d8-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl100001d8Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-10000-1d8-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-10000-1d8-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def DbpediaGenre( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def DbpediaGenre(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the dbpedia-genre graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of dbpedia-genre graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="DbpediaGenre",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the dbpedia-genre graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of dbpedia-genre graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Tube1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Tube1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the tube1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of tube1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Tube1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the tube1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of tube1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ex5( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ex5(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the EX5 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of EX5 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ex5",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the EX5 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of EX5 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100030d1Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100030d1Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-3-0d1-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-3-0d1-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100030d1Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-3-0d1-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-3-0d1-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Jagmesh4( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Jagmesh4(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the jagmesh4 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of jagmesh4 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Jagmesh4",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the jagmesh4 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of jagmesh4 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def NR145bit( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def NR145bit(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the 145bit graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of 145bit graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="NR145bit",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the 145bit graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of 145bit graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Journals( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Journals(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Journals graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Journals graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Journals",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Journals graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Journals graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Hamming84( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Hamming84(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the hamming8-4 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of hamming8-4 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Hamming84",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the hamming8-4 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of hamming8-4 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def HepTh( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def HepTh(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the hep-th graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of hep-th graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="HepTh",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the hep-th graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of hep-th graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Lock3491( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Lock3491(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the lock3491 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of lock3491 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Lock3491",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the lock3491 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of lock3491 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Eva( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Eva(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the EVA graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of EVA graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Eva",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the EVA graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of EVA graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10002d1Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10002d1Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000-2d1-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000-2d1-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10002d1Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000-2d1-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000-2d1-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Geom( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Geom(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the geom graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of geom graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Geom",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the geom graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of geom graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Bcspwr09( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcspwr09(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcspwr09 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcspwr09 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcspwr09",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcspwr09 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcspwr09 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbTufts18( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbTufts18(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Tufts18 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Tufts18 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbTufts18",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Tufts18 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Tufts18 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def SocTwitterMpiSws( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocTwitterMpiSws(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-twitter-mpi-sws graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-twitter-mpi-sws graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{icwsm10cha,
	        author = {Meeyoung Cha and Hamed Haddadi and Fabricio Benevenuto and Krishna P. Gummadi},
	        title = {Measuring User Influence in Twitter: The Million Follower Fallacy},
	        booktitle = {ICWSM},
	        month = {May},
	        year = {2010},
	        address = {Washington DC, USA}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocTwitterMpiSws",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-twitter-mpi-sws graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-twitter-mpi-sws graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{icwsm10cha,
        author = {Meeyoung Cha and Hamed Haddadi and Fabricio Benevenuto and Krishna P. Gummadi},
        title = {Measuring User Influence in Twitter: The Million Follower Fallacy},
        booktitle = {ICWSM},
        month = {May},
        year = {2010},
        address = {Washington DC, USA}
}
#   def SocTwitterFollowsMun( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocTwitterFollowsMun(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-twitter-follows-mun graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-twitter-follows-mun graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{de2010does,
	        title={How does the data sampling strategy impact the discovery of information diffusion in social media?},
	        author={De Choudhury, Munmun and Lin, Yu-Ru and Sundaram, Hari and Candan, K Selcuk and Xie, Lexing and Kelliher, Aisling},
	        journal={ICWSM},
	        volume={10},
	        pages={34--41},
	        year={2010}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocTwitterFollowsMun",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-twitter-follows-mun graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-twitter-follows-mun graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{de2010does,
        title={How does the data sampling strategy impact the discovery of information diffusion in social media?},
        author={De Choudhury, Munmun and Lin, Yu-Ru and Sundaram, Hari and Candan, K Selcuk and Xie, Lexing and Kelliher, Aisling},
        journal={ICWSM},
        volume={10},
        pages={34--41},
        year={2010}
}
#   def SocfbMu78( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbMu78(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-MU78 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-MU78 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbMu78",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-MU78 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-MU78 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Cl100002d0Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl100002d0Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-10000-2d0-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-10000-2d0-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl100002d0Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-10000-2d0-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-10000-2d0-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Bcsstk32( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcsstk32(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcsstk32 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcsstk32 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcsstk32",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcsstk32 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcsstk32 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def RoadnetCa( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def RoadnetCa(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the roadNet-CA graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of roadNet-CA graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="RoadnetCa",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the roadNet-CA graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of roadNet-CA graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def AffWikiWordbypage( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def AffWikiWordbypage(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the aff-wiki-wordbypage graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of aff-wiki-wordbypage graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="AffWikiWordbypage",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the aff-wiki-wordbypage graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of aff-wiki-wordbypage graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def As20000102( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def As20000102(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the as20000102 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of as20000102 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="As20000102",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the as20000102 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of as20000102 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cnr2000( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cnr2000(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cnr-2000 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cnr-2000 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cnr2000",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cnr-2000 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cnr-2000 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def InfRoadnetCa( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def InfRoadnetCa(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the inf-roadNet-CA graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of inf-roadNet-CA graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="InfRoadnetCa",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the inf-roadNet-CA graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of inf-roadNet-CA graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}
#   def Jgl009( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Jgl009(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the jgl009 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of jgl009 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Jgl009",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the jgl009 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of jgl009 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Air05( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Air05(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the air05 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of air05 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Air05",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the air05 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of air05 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Rail2586( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Rail2586(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the rail2586 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of rail2586 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Rail2586",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the rail2586 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of rail2586 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Pwt( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pwt(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the pwt graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of pwt graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pwt",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the pwt graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of pwt graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocEpinions1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocEpinions1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-Epinions1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-Epinions1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocEpinions1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-Epinions1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-Epinions1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G67( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G67(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G67 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G67 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G67",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G67 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G67 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Tf19( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Tf19(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the TF19 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of TF19 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Tf19",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the TF19 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of TF19 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Pattern1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pattern1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the pattern1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of pattern1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pattern1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the pattern1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of pattern1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbUva16( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUva16(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-UVA16 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-UVA16 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUva16",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-UVA16 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-UVA16 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Nasa4704( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Nasa4704(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the nasa4704 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of nasa4704 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Nasa4704",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the nasa4704 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of nasa4704 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def TechCaidarouterlevel( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def TechCaidarouterlevel(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the tech-caidaRouterLevel graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of tech-caidaRouterLevel graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="TechCaidarouterlevel",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the tech-caidaRouterLevel graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of tech-caidaRouterLevel graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}
#   def Cs4( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cs4(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cs4 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cs4 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cs4",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cs4 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cs4 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ash608( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ash608(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ash608 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ash608 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ash608",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ash608 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ash608 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Hugetric00000( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Hugetric00000(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the hugetric-00000 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of hugetric-00000 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Hugetric00000",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the hugetric-00000 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of hugetric-00000 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Hugetric00010( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Hugetric00010(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the hugetric-00010 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of hugetric-00010 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Hugetric00010",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the hugetric-00010 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of hugetric-00010 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioYeastProteinInter( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioYeastProteinInter(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-yeast-protein-inter graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-yeast-protein-inter graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{jeong2001lethality,
	        title={Lethality and centrality in protein networks},
	        author={Jeong, H. and Mason, S.P. and Barabasi, A.L. and Oltvai, Z.N.},
	        journal={arXiv preprint cond-mat/0105306},
	        year={2001}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioYeastProteinInter",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-yeast-protein-inter graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-yeast-protein-inter graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{jeong2001lethality,
        title={Lethality and centrality in protein networks},
        author={Jeong, H. and Mason, S.P. and Barabasi, A.L. and Oltvai, Z.N.},
        journal={arXiv preprint cond-mat/0105306},
        year={2001}
}
#   def SocFirmHiTech( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocFirmHiTech(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-firm-hi-tech graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-firm-hi-tech graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocFirmHiTech",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-firm-hi-tech graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-firm-hi-tech graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G15( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G15(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G15 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G15 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G15",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G15 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G15 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocOrkut( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocOrkut(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-orkut graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-orkut graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{mislove-2007-socialnetworks,
	        author = {Alan Mislove and Massimiliano Marcon and Krishna P. Gummadi and Peter Druschel and Bobby Bhattacharjee},
	        title = {{Measurement and Analysis of Online Social Networks}},
	        booktitle = {Proceedings of the 5th ACM/Usenix Internet Measurement Conference (IMC'07)},
	        address = {San Diego, CA},
	        month = {October},
	        year = {2007}}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocOrkut",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-orkut graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-orkut graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{mislove-2007-socialnetworks,
        author = {Alan Mislove and Massimiliano Marcon and Krishna P. Gummadi and Peter Druschel and Bobby Bhattacharjee},
        title = {{Measurement and Analysis of Online Social Networks}},
        booktitle = {Proceedings of the 5th ACM/Usenix Internet Measurement Conference (IMC'07)},
        address = {San Diego, CA},
        month = {October},
        year = {2007}}
#   def MiscReuters911( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def MiscReuters911(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the misc-Reuters911 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of misc-Reuters911 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{corman2002studying,
	        title={Studying Complex Discursive Systems.},
	        author={Corman, Steven R and Kuhn, Timothy and McPhee, Robert D and Dooley, Kevin J},
	        journal={Human communication research},
	        volume={28},
	        number={2},
	        pages={157--206},
	        year={2002},
	        publisher={Wiley Online Library}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="MiscReuters911",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the misc-Reuters911 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of misc-Reuters911 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{corman2002studying,
        title={Studying Complex Discursive Systems.},
        author={Corman, Steven R and Kuhn, Timothy and McPhee, Robert D and Dooley, Kevin J},
        journal={Human communication research},
        volume={28},
        number={2},
        pages={157--206},
        year={2002},
        publisher={Wiley Online Library}
}
#   def Cl10001d9Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10001d9Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000-1d9-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000-1d9-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10001d9Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000-1d9-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000-1d9-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def In2004( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def In2004(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the in-2004 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of in-2004 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="In2004",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the in-2004 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of in-2004 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Brock4002( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Brock4002(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the brock400-2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of brock400-2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Brock4002",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the brock400-2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of brock400-2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Netz4504( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Netz4504(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the netz4504 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of netz4504 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Netz4504",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the netz4504 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of netz4504 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def PowerUsGrid( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def PowerUsGrid(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the power-US-Grid graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of power-US-Grid graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="PowerUsGrid",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the power-US-Grid graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of power-US-Grid graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def RoadEuroroad( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def RoadEuroroad(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the road-euroroad graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of road-euroroad graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="RoadEuroroad",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the road-euroroad graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of road-euroroad graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Bcsstm05( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcsstm05(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcsstm05 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcsstm05 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcsstm05",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcsstm05 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcsstm05 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ragusa16( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ragusa16(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Ragusa16 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Ragusa16 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ragusa16",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Ragusa16 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Ragusa16 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def OpsahlPowergrid( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def OpsahlPowergrid(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the opsahl-powergrid graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of opsahl-powergrid graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="OpsahlPowergrid",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the opsahl-powergrid graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of opsahl-powergrid graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbUsfca72( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUsfca72(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-USFCA72 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-USFCA72 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUsfca72",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-USFCA72 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-USFCA72 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Sw10040d1Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10040d1Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-4-0d1-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-4-0d1-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10040d1Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-4-0d1-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-4-0d1-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbOklahoma97( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbOklahoma97(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Oklahoma97 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Oklahoma97 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbOklahoma97",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Oklahoma97 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Oklahoma97 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Sw1000060d1Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000060d1Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-6-0d1-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-6-0d1-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000060d1Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-6-0d1-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-6-0d1-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocDouban( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocDouban(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-douban graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-douban graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{zafarani2014users,
	        title={Users Joining Multiple Sites: Distributions and Patterns},
	        author={Zafarani, Reza and Liu, Huan},
	        booktitle = {Proceedings of the 8th International AAAI Conference on Weblogs and Social Media (ICWSM'14)},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocDouban",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-douban graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-douban graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{zafarani2014users,
        title={Users Joining Multiple Sites: Distributions and Patterns},
        author={Zafarani, Reza and Liu, Huan},
        booktitle = {Proceedings of the 8th International AAAI Conference on Weblogs and Social Media (ICWSM'14)},
        year={2014}
}
#   def SocfbBucknell39( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbBucknell39(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Bucknell39 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Bucknell39 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbBucknell39",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Bucknell39 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Bucknell39 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Cl1000001d7Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl1000001d7Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-100000-1d7-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-100000-1d7-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl1000001d7Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-100000-1d7-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-100000-1d7-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CaActorCollaboration( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CaActorCollaboration(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ca-actor-collaboration graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ca-actor-collaboration graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CaActorCollaboration",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ca-actor-collaboration graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ca-actor-collaboration graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def NR3elt( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def NR3elt(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the 3elt graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of 3elt graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="NR3elt",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the 3elt graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of 3elt graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WebSk2005( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebSk2005(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-sk-2005 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-sk-2005 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@ARTICLE{boldi2004-ubicrawler,
	        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
	        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
	        journal = {Software: Practice \& Experience},
	        year = {2004},
	        volume = {34},
	        pages = {711--726},
	        number = {8}}
	
	@INPROCEEDINGS{Boldi-2011-layered,
	        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
	        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering	for Compressing Social Networks},
	        booktitle = {WWW},
	        year = {2011},
	        pages = {587--596}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebSk2005",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-sk-2005 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-sk-2005 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@ARTICLE{boldi2004-ubicrawler,
        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
        journal = {Software: Practice \& Experience},
        year = {2004},
        volume = {34},
        pages = {711--726},
        number = {8}}

@INPROCEEDINGS{Boldi-2011-layered,
        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering  for Compressing Social Networks},
        booktitle = {WWW},
        year = {2011},
        pages = {587--596}
}
#   def Cl100001d8Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl100001d8Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-10000-1d8-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-10000-1d8-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl100001d8Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-10000-1d8-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-10000-1d8-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100040d3Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100040d3Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-4-0d3-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-4-0d3-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100040d3Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-4-0d3-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-4-0d3-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cage8( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cage8(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cage8 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cage8 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cage8",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cage8 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cage8 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CitPatent( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CitPatent(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cit-patent graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cit-patent graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CitPatent",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cit-patent graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cit-patent graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioHsLc( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioHsLc(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-HS-LC graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-HS-LC graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{cho2014wormnet,
	        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
	        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
	        journal={Nucleic acids research},
	        volume={42},
	        number={W1},
	        pages={W76--W82},
	        year={2014},
	        publisher={Oxford University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioHsLc",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-HS-LC graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-HS-LC graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{cho2014wormnet,
        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
        journal={Nucleic acids research},
        volume={42},
        number={W1},
        pages={W76--W82},
        year={2014},
        publisher={Oxford University Press}
}
#   def Trec12( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Trec12(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Trec12 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Trec12 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Trec12",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Trec12 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Trec12 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Caidarouterlevel( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Caidarouterlevel(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the caidaRouterLevel graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of caidaRouterLevel graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Caidarouterlevel",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the caidaRouterLevel graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of caidaRouterLevel graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def DbpediaLocation( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def DbpediaLocation(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the dbpedia-location graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of dbpedia-location graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="DbpediaLocation",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the dbpedia-location graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of dbpedia-location graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G59( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G59(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G59 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G59 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G59",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G59 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G59 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G49( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G49(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G49 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G49 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G49",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G49 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G49 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G6( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G6(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G6 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G6 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G6",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G6 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G6 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def It2004( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def It2004(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the it-2004 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of it-2004 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="It2004",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the it-2004 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of it-2004 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CFat5002( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CFat5002(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the c-fat500-2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of c-fat500-2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CFat5002",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the c-fat500-2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of c-fat500-2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Bcspwr08( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcspwr08(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcspwr08 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcspwr08 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcspwr08",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcspwr08 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcspwr08 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10002d1Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10002d1Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000-2d1-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000-2d1-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10002d1Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000-2d1-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000-2d1-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def San400071( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def San400071(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the san400-0-7-1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of san400-0-7-1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="San400071",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the san400-0-7-1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of san400-0-7-1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def SocfbUf21( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUf21(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-UF21 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-UF21 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUf21",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-UF21 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-UF21 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def SlashdotZoo( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SlashdotZoo(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the slashdot-zoo graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of slashdot-zoo graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SlashdotZoo",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the slashdot-zoo graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of slashdot-zoo graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw1000060d3L2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000060d3L2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-6-0d3-L2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-6-0d3-L2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000060d3L2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-6-0d3-L2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-6-0d3-L2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ex4( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ex4(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the EX4 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of EX4 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ex4",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the EX4 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of EX4 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ibm32( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ibm32(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ibm32 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ibm32 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ibm32",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ibm32 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ibm32 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Appu( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Appu(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the appu graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of appu graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Appu",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the appu graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of appu graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100030d2Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100030d2Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-3-0d2-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-3-0d2-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100030d2Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-3-0d2-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-3-0d2-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocDogster( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocDogster(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-dogster graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-dogster graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{soc-dogster,
	        author={Dogster},
	        title={Dogster social network},
	        note={http://www.dogster.com}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocDogster",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-dogster graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-dogster graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{soc-dogster,
        author={Dogster},
        title={Dogster social network},
        note={http://www.dogster.com}
}
#   def Jagmesh5( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Jagmesh5(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the jagmesh5 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of jagmesh5 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Jagmesh5",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the jagmesh5 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of jagmesh5 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Grid2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Grid2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the grid2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of grid2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Grid2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the grid2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of grid2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G66( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G66(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G66 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G66 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G66",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G66 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G66 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Mri2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Mri2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the mri2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of mri2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Mri2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the mri2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of mri2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Diag( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Diag(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the diag graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of diag graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Diag",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the diag graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of diag graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbUchicago30( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUchicago30(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-UChicago30 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-UChicago30 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUchicago30",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-UChicago30 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-UChicago30 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def SocfbWilliams40( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbWilliams40(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Williams40 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Williams40 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbWilliams40",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Williams40 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Williams40 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Actor( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Actor(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the actor graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of actor graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Actor",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the actor graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of actor graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbBrown11( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbBrown11(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Brown11 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Brown11 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbBrown11",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Brown11 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Brown11 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def T520( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def T520(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the t520 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of t520 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="T520",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the t520 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of t520 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Tf18( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Tf18(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the TF18 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of TF18 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Tf18",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the TF18 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of TF18 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioCeLc( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioCeLc(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-CE-LC graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-CE-LC graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{cho2014wormnet,
	        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
	        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
	        journal={Nucleic acids research},
	        volume={42},
	        number={W1},
	        pages={W76--W82},
	        year={2014},
	        publisher={Oxford University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioCeLc",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-CE-LC graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-CE-LC graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{cho2014wormnet,
        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
        journal={Nucleic acids research},
        volume={42},
        number={W1},
        pages={W76--W82},
        year={2014},
        publisher={Oxford University Press}
}
#   def Sw10030d3Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10030d3Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-3-0d3-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-3-0d3-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10030d3Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-3-0d3-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-3-0d3-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def T60k( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def T60k(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the t60k graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of t60k graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="T60k",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the t60k graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of t60k graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Bcsstk33( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcsstk33(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcsstk33 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcsstk33 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcsstk33",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcsstk33 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcsstk33 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Crack( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Crack(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the crack graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of crack graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Crack",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the crack graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of crack graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl100002d0Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl100002d0Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-10000-2d0-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-10000-2d0-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl100002d0Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-10000-2d0-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-10000-2d0-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbSanta74( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbSanta74(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Santa74 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Santa74 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbSanta74",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Santa74 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Santa74 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def SocfbCornell5( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbCornell5(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Cornell5 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Cornell5 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbCornell5",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Cornell5 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Cornell5 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Air04( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Air04(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the air04 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of air04 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Air04",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the air04 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of air04 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def PetsterFriendshipsDog( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def PetsterFriendshipsDog(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the petster-friendships-dog graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of petster-friendships-dog graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="PetsterFriendshipsDog",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the petster-friendships-dog graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of petster-friendships-dog graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw1000060d2Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000060d2Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-6-0d2-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-6-0d2-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000060d2Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-6-0d2-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-6-0d2-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioGridFissionYeast( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioGridFissionYeast(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-grid-fission-yeast graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-grid-fission-yeast graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioGridFissionYeast",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-grid-fission-yeast graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-grid-fission-yeast graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw10040d2Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10040d2Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-4-0d2-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-4-0d2-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10040d2Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-4-0d2-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-4-0d2-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Pct20stif( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pct20stif(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the pct20stif graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of pct20stif graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pct20stif",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the pct20stif graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of pct20stif graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def ComYoutube( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def ComYoutube(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the com-youtube graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of com-youtube graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="ComYoutube",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the com-youtube graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of com-youtube graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def PetsterFriendshipsCat( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def PetsterFriendshipsCat(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the petster-friendships-cat graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of petster-friendships-cat graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="PetsterFriendshipsCat",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the petster-friendships-cat graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of petster-friendships-cat graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbHarvard1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbHarvard1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Harvard1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Harvard1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbHarvard1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Harvard1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Harvard1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Hugetrace00000( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Hugetrace00000(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the hugetrace-00000 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of hugetrace-00000 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Hugetrace00000",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the hugetrace-00000 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of hugetrace-00000 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Brock4003( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Brock4003(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the brock400-3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of brock400-3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Brock4003",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the brock400-3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of brock400-3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Polblogs( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Polblogs(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the polblogs graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of polblogs graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Polblogs",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the polblogs graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of polblogs graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Hugetrace00010( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Hugetrace00010(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the hugetrace-00010 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of hugetrace-00010 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Hugetrace00010",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the hugetrace-00010 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of hugetrace-00010 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10001d9Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10001d9Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000-1d9-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000-1d9-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10001d9Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000-1d9-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000-1d9-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Roget( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Roget(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Roget graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Roget graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Roget",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Roget graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Roget graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G14( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G14(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G14 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G14 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G14",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G14 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G14 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WebPolblogs( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebPolblogs(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-polblogs graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-polblogs graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{adamic2005political,
	        title={The political blogosphere and the 2004 US election: divided they blog},
	        author={Adamic, Lada A and Glance, Natalie},
	        booktitle={Proceedings of the 3rd international workshop on Link discovery},
	        pages={36--43},
	        year={2005},
	        organization={ACM}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebPolblogs",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-polblogs graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-polblogs graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{adamic2005political,
        title={The political blogosphere and the 2004 US election: divided they blog},
        author={Adamic, Lada A and Glance, Natalie},
        booktitle={Proceedings of the 3rd international workshop on Link discovery},
        pages={36--43},
        year={2005},
        organization={ACM}
}
#   def ArenasPgp( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def ArenasPgp(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the arenas-pgp graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of arenas-pgp graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="ArenasPgp",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the arenas-pgp graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of arenas-pgp graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Netscience( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Netscience(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the netscience graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of netscience graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Netscience",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the netscience graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of netscience graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbVirginia63( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbVirginia63(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Virginia63 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Virginia63 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbVirginia63",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Virginia63 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Virginia63 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Plc6030L2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Plc6030L2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the PLC-60-30-L2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of PLC-60-30-L2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Plc6030L2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the PLC-60-30-L2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of PLC-60-30-L2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Gene( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Gene(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the gene graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of gene graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Gene",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the gene graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of gene graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def FoodwebBaywet( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def FoodwebBaywet(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the foodweb-baywet graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of foodweb-baywet graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="FoodwebBaywet",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the foodweb-baywet graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of foodweb-baywet graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G22( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G22(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G22 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G22 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G22",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G22 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G22 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Indochina2004( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Indochina2004(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the indochina-2004 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of indochina-2004 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Indochina2004",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the indochina-2004 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of indochina-2004 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Bcspwr01( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcspwr01(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcspwr01 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcspwr01 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcspwr01",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcspwr01 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcspwr01 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioGridHuman( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioGridHuman(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-grid-human graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-grid-human graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioGridHuman",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-grid-human graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-grid-human graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Coauthorsciteseer( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Coauthorsciteseer(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the coAuthorsCiteseer graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of coAuthorsCiteseer graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Coauthorsciteseer",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the coAuthorsCiteseer graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of coAuthorsCiteseer graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocBlogcatalog( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocBlogcatalog(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-BlogCatalog graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-BlogCatalog graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{zafarani2014users,
	        title={Users Joining Multiple Sites: Distributions and Patterns},
	        author={Zafarani, Reza and Liu, Huan},
	        booktitle = {Proceedings of the 8th International AAAI Conference on Weblogs and Social Media (ICWSM'14)},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocBlogcatalog",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-BlogCatalog graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-BlogCatalog graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{zafarani2014users,
        title={Users Joining Multiple Sites: Distributions and Patterns},
        author={Zafarani, Reza and Liu, Huan},
        booktitle = {Proceedings of the 8th International AAAI Conference on Weblogs and Social Media (ICWSM'14)},
        year={2014}
}
#   def BioScCc( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioScCc(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-SC-CC graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-SC-CC graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{cho2014wormnet,
	        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
	        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
	        journal={Nucleic acids research},
	        volume={42},
	        number={W1},
	        pages={W76--W82},
	        year={2014},
	        publisher={Oxford University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioScCc",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-SC-CC graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-SC-CC graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{cho2014wormnet,
        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
        journal={Nucleic acids research},
        volume={42},
        number={W1},
        pages={W76--W82},
        year={2014},
        publisher={Oxford University Press}
}
#   def SocFoursquare( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocFoursquare(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-FourSquare graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-FourSquare graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{gao2012exploring,
	        title={Exploring social-historical ties on location-based social networks},
	        author={Gao, Huiji and Tang, Jiliang and Liu, Huan},
	        booktitle={Proceedings of the 6th International AAAI Conference on Weblogs and Social Media},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocFoursquare",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-FourSquare graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-FourSquare graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{gao2012exploring,
        title={Exploring social-historical ties on location-based social networks},
        author={Gao, Huiji and Tang, Jiliang and Liu, Huan},
        booktitle={Proceedings of the 6th International AAAI Conference on Weblogs and Social Media},
        year={2012}
}
#   def Bcsstm22( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcsstm22(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcsstm22 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcsstm22 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcsstm22",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcsstm22 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcsstm22 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Qa8fm( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Qa8fm(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the qa8fm graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of qa8fm graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Qa8fm",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the qa8fm graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of qa8fm graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbWellesley22( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbWellesley22(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Wellesley22 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Wellesley22 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbWellesley22",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Wellesley22 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Wellesley22 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Halfb( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Halfb(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the halfb graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of halfb graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Halfb",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the halfb graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of halfb graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def ComAmazon( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def ComAmazon(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the com-amazon graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of com-amazon graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="ComAmazon",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the com-amazon graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of com-amazon graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def RoadRoadUsa( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def RoadRoadUsa(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the road-road-usa graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of road-road-usa graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="RoadRoadUsa",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the road-road-usa graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of road-road-usa graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbUconn( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUconn(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-UConn graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-UConn graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUconn",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-UConn graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-UConn graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def EmailEnronOnly( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def EmailEnronOnly(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the email-enron-only graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of email-enron-only graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="EmailEnronOnly",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the email-enron-only graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of email-enron-only graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def UcidataGama( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def UcidataGama(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ucidata-gama graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ucidata-gama graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="UcidataGama",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ucidata-gama graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ucidata-gama graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Dd68( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Dd68(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the DD68 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of DD68 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Dd68",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the DD68 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of DD68 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw10050d1Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10050d1Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-5-0d1-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-5-0d1-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10050d1Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-5-0d1-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-5-0d1-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbUga50( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUga50(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-UGA50 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-UGA50 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUga50",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-UGA50 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-UGA50 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Pkustk06( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pkustk06(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the pkustk06 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of pkustk06 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pkustk06",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the pkustk06 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of pkustk06 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl1000001d9Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl1000001d9Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-100000-1d9-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-100000-1d9-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl1000001d9Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-100000-1d9-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-100000-1d9-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw10050d2Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10050d2Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-5-0d2-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-5-0d2-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10050d2Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-5-0d2-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-5-0d2-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocYoutube( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocYoutube(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-youtube graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-youtube graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{mislove-2007-socialnetworks,
	        author = {Alan Mislove and Massimiliano Marcon and Krishna P. Gummadi and Peter Druschel and Bobby Bhattacharjee},
	        title = {{Measurement and Analysis of Online Social Networks}},
	        booktitle = {Proceedings of the 5th ACM/Usenix Internet Measurement Conference (IMC'07)},
	        address = {San Diego, CA},
	        month = {October},
	        year = {2007}}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocYoutube",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-youtube graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-youtube graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{mislove-2007-socialnetworks,
        author = {Alan Mislove and Massimiliano Marcon and Krishna P. Gummadi and Peter Druschel and Bobby Bhattacharjee},
        title = {{Measurement and Analysis of Online Social Networks}},
        booktitle = {Proceedings of the 5th ACM/Usenix Internet Measurement Conference (IMC'07)},
        address = {San Diego, CA},
        month = {October},
        year = {2007}}
#   def Stufe10( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Stufe10(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the stufe-10 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of stufe-10 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Stufe10",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the stufe-10 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of stufe-10 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100060d1Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100060d1Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-6-0d1-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-6-0d1-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100060d1Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-6-0d1-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-6-0d1-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10000002d0Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10000002d0Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000000-2d0-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000000-2d0-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10000002d0Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000000-2d0-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000000-2d0-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sphere2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sphere2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the sphere2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of sphere2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sphere2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the sphere2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of sphere2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Enzymes118( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Enzymes118(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ENZYMES118 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ENZYMES118 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Enzymes118",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ENZYMES118 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ENZYMES118 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbIndiana( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbIndiana(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Indiana graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Indiana graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbIndiana",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Indiana graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Indiana graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Opt1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Opt1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the opt1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of opt1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Opt1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the opt1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of opt1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G40( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G40(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G40 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G40 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G40",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G40 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G40 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100060d2Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100060d2Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-6-0d2-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-6-0d2-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100060d2Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-6-0d2-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-6-0d2-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G50( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G50(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G50 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G50 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G50",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G50 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G50 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def EconPsmigr2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def EconPsmigr2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the econ-psmigr2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of econ-psmigr2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="EconPsmigr2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the econ-psmigr2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of econ-psmigr2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100050d3Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100050d3Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-5-0d3-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-5-0d3-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100050d3Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-5-0d3-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-5-0d3-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbMit8( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbMit8(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-MIT8 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-MIT8 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbMit8",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-MIT8 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-MIT8 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def P2pGnutella04( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def P2pGnutella04(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the p2p-Gnutella04 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of p2p-Gnutella04 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="P2pGnutella04",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the p2p-Gnutella04 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of p2p-Gnutella04 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def DblpAuthor( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def DblpAuthor(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the dblp-author graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of dblp-author graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="DblpAuthor",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the dblp-author graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of dblp-author graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Citationciteseer( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Citationciteseer(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the citationCiteseer graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of citationCiteseer graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Citationciteseer",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the citationCiteseer graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of citationCiteseer graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10001d7Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10001d7Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000-1d7-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000-1d7-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10001d7Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000-1d7-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000-1d7-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw10060d3Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10060d3Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-6-0d3-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-6-0d3-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10060d3Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-6-0d3-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-6-0d3-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw1000040d3Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000040d3Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-4-0d3-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-4-0d3-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000040d3Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-4-0d3-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-4-0d3-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def InfOpenflights( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def InfOpenflights(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the inf-openflights graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of inf-openflights graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{opsahl2011anchorage,
	        title={Why anchorage is not (that) important: Binary ties and sample selection},
	        author={Opsahl, Tore},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="InfOpenflights",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the inf-openflights graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of inf-openflights graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{opsahl2011anchorage,
        title={Why anchorage is not (that) important: Binary ties and sample selection},
        author={Opsahl, Tore},
        year={2011}
}
#   def NR08blocks( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def NR08blocks(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the 08blocks graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of 08blocks graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="NR08blocks",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the 08blocks graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of 08blocks graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ig513( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ig513(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the IG5-13 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of IG5-13 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ig513",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the IG5-13 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of IG5-13 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Channel500x100x100B050( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Channel500x100x100B050(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the channel-500x100x100-b050 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of channel-500x100x100-b050 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Channel500x100x100B050",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the channel-500x100x100-b050 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of channel-500x100x100-b050 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def TechAsCaida2007( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def TechAsCaida2007(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the tech-as-caida2007 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of tech-as-caida2007 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{routeviews,
	    author = {{Internet-AS}},
	    title  = {{Oregon RouteViews} Project},
	    note   = {{http://www.routeviews.org/}}
	}
	
	@inproceedings{rossi2013topology,
	        title={A Multi-Level Approach for Evaluating Internet Topology Generators},
	        author={Ryan A. Rossi and Sonia Fahmy and Nilothpal Talukder},
	        booktitle={Networking},
	        pages={1--9},
	        year={2013}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="TechAsCaida2007",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the tech-as-caida2007 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of tech-as-caida2007 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{routeviews,
    author = {{Internet-AS}},
    title  = {{Oregon RouteViews} Project},
    note   = {{http://www.routeviews.org/}}
}

@inproceedings{rossi2013topology,
        title={A Multi-Level Approach for Evaluating Internet Topology Generators},
        author={Ryan A. Rossi and Sonia Fahmy and Nilothpal Talukder},
        booktitle={Networking},
        pages={1--9},
        year={2013}
}
#   def Sw1000030d2Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000030d2Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-3-0d2-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-3-0d2-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000030d2Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-3-0d2-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-3-0d2-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Twitter( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Twitter(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the twitter graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of twitter graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Twitter",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the twitter graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of twitter graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Johnson824( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Johnson824(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the johnson8-2-4 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of johnson8-2-4 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Johnson824",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the johnson8-2-4 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of johnson8-2-4 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Cl10000001d8Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10000001d8Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000000-1d8-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000000-1d8-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10000001d8Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000000-1d8-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000000-1d8-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw1000030d1Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000030d1Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-3-0d1-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-3-0d1-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000030d1Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-3-0d1-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-3-0d1-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Copter1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Copter1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the copter1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of copter1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Copter1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the copter1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of copter1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def PHat15001( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def PHat15001(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the p-hat1500-1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of p-hat1500-1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="PHat15001",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the p-hat1500-1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of p-hat1500-1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Tf11( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Tf11(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the TF11 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of TF11 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Tf11",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the TF11 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of TF11 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Dixmaanl( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Dixmaanl(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the dixmaanl graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of dixmaanl graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Dixmaanl",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the dixmaanl graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of dixmaanl graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioHumanGene2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioHumanGene2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-human-gene2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-human-gene2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{bansal2007infer,
	        title={How to infer gene networks from expression profiles},
	        author={Bansal, Mukesh and Belcastro, Vincenzo and Ambesi-Impiombato, Alberto and Di Bernardo, Diego},
	        journal={Molecular systems biology},
	        volume={3},
	        number={1},
	        year={2007},
	        publisher={Wiley Online Library}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioHumanGene2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-human-gene2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-human-gene2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{bansal2007infer,
        title={How to infer gene networks from expression profiles},
        author={Bansal, Mukesh and Belcastro, Vincenzo and Ambesi-Impiombato, Alberto and Di Bernardo, Diego},
        journal={Molecular systems biology},
        volume={3},
        number={1},
        year={2007},
        publisher={Wiley Online Library}
}
#   def FsFa( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def FsFa(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the fs-FA graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of fs-FA graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="FsFa",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the fs-FA graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of fs-FA graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl1000002d1Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl1000002d1Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-100000-2d1-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-100000-2d1-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl1000002d1Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-100000-2d1-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-100000-2d1-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Wave( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Wave(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the wave graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of wave graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Wave",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the wave graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of wave graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Gupta3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Gupta3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the gupta3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of gupta3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Gupta3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the gupta3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of gupta3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Jgl011( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Jgl011(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the jgl011 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of jgl011 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Jgl011",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the jgl011 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of jgl011 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Dd242( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Dd242(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the DD242 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of DD242 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Dd242",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the DD242 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of DD242 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def FeSphere( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def FeSphere(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the fe-sphere graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of fe-sphere graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="FeSphere",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the fe-sphere graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of fe-sphere graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}
#   def Bcsstm08( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcsstm08(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcsstm08 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcsstm08 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcsstm08",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcsstm08 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcsstm08 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbNipsEgo( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbNipsEgo(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-nips-ego graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-nips-ego graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbNipsEgo",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-nips-ego graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-nips-ego graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Net41( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Net41(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the net4-1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of net4-1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Net41",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the net4-1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of net4-1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def TechArenasJazz( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def TechArenasJazz(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the tech-arenas-jazz graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of tech-arenas-jazz graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="TechArenasJazz",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the tech-arenas-jazz graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of tech-arenas-jazz graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10001d8Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10001d8Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000-1d8-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000-1d8-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10001d8Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000-1d8-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000-1d8-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbVermont70( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbVermont70(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Vermont70 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Vermont70 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbVermont70",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Vermont70 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Vermont70 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def SocDigg( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocDigg(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-digg graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-digg graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{zafarani2014users,
	        title={Users Joining Multiple Sites: Distributions and Patterns},
	        author={Zafarani, Reza and Liu, Huan},
	        booktitle = {Proceedings of the 8th International AAAI Conference on Weblogs and Social Media (ICWSM'14)},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocDigg",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-digg graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-digg graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{zafarani2014users,
        title={Users Joining Multiple Sites: Distributions and Patterns},
        author={Zafarani, Reza and Liu, Huan},
        booktitle = {Proceedings of the 8th International AAAI Conference on Weblogs and Social Media (ICWSM'14)},
        year={2014}
}
#   def Sw10040d3Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10040d3Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-4-0d3-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-4-0d3-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10040d3Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-4-0d3-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-4-0d3-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Uk2005( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Uk2005(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the uk-2005 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of uk-2005 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Uk2005",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the uk-2005 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of uk-2005 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def InfPower( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def InfPower(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the inf-power graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of inf-power graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{watts1998collective,
	        title={Collective dynamics of small-world networks},
	        author={Watts, Duncan J and Strogatz, Steven H},
	        journal={nature},
	        volume={393},
	        number={6684},
	        pages={440--442},
	        year={1998},
	        publisher={Nature Publishing Group}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="InfPower",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the inf-power graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of inf-power graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{watts1998collective,
        title={Collective dynamics of small-world networks},
        author={Watts, Duncan J and Strogatz, Steven H},
        journal={nature},
        volume={393},
        number={6684},
        pages={440--442},
        year={1998},
        publisher={Nature Publishing Group}
}
#   def Sw1000060d3Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000060d3Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-6-0d3-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-6-0d3-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000060d3Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-6-0d3-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-6-0d3-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WebUk2005All( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebUk2005All(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-uk-2005-all graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-uk-2005-all graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@ARTICLE{boldi2004-ubicrawler,
	        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
	        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
	        journal = {Software: Practice \& Experience},
	        year = {2004},
	        volume = {34},
	        pages = {711--726},
	        number = {8}}
	
	@INPROCEEDINGS{Boldi-2011-layered,
	        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
	        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering	for Compressing Social Networks},
	        booktitle = {WWW},
	        year = {2011},
	        pages = {587--596}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebUk2005All",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-uk-2005-all graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-uk-2005-all graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@ARTICLE{boldi2004-ubicrawler,
        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
        journal = {Software: Practice \& Experience},
        year = {2004},
        volume = {34},
        pages = {711--726},
        number = {8}}

@INPROCEEDINGS{Boldi-2011-layered,
        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering  for Compressing Social Networks},
        booktitle = {WWW},
        year = {2011},
        pages = {587--596}
}
#   def Lock1074( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Lock1074(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the lock1074 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of lock1074 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Lock1074",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the lock1074 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of lock1074 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def PetsterFriendshipsHamster( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def PetsterFriendshipsHamster(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the petster-friendships-hamster graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of petster-friendships-hamster graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="PetsterFriendshipsHamster",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the petster-friendships-hamster graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of petster-friendships-hamster graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbRutgers89( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbRutgers89(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Rutgers89 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Rutgers89 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbRutgers89",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Rutgers89 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Rutgers89 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Cl100002d1Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl100002d1Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-10000-2d1-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-10000-2d1-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl100002d1Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-10000-2d1-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-10000-2d1-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def RoadAsiaOsm( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def RoadAsiaOsm(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the road-asia-osm graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of road-asia-osm graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="RoadAsiaOsm",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the road-asia-osm graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of road-asia-osm graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw10030d2Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10030d2Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-3-0d2-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-3-0d2-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10030d2Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-3-0d2-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-3-0d2-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CFat50010( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CFat50010(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the c-fat500-10 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of c-fat500-10 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CFat50010",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the c-fat500-10 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of c-fat500-10 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Brock2002( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Brock2002(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the brock200-2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of brock200-2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Brock2002",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the brock200-2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of brock200-2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Tf14( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Tf14(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the TF14 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of TF14 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Tf14",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the TF14 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of TF14 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Rajat06( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Rajat06(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the rajat06 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of rajat06 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Rajat06",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the rajat06 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of rajat06 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ig516( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ig516(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the IG5-16 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of IG5-16 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ig516",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the IG5-16 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of IG5-16 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def As22july06( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def As22july06(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the as-22july06 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of as-22july06 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="As22july06",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the as-22july06 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of as-22july06 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CFat2005( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CFat2005(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the c-fat200-5 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of c-fat200-5 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CFat2005",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the c-fat200-5 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of c-fat200-5 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def WebkbWisc( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebkbWisc(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the webkb-wisc graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of webkb-wisc graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebkbWisc",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the webkb-wisc graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of webkb-wisc graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10000001d7Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10000001d7Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000000-1d7-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000000-1d7-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10000001d7Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000000-1d7-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000000-1d7-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbUcsc68( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUcsc68(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-UCSC68 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-UCSC68 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUcsc68",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-UCSC68 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-UCSC68 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Shock9( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Shock9(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the shock-9 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of shock-9 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Shock9",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the shock-9 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of shock-9 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def San200091( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def San200091(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the san200-0-9-1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of san200-0-9-1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="San200091",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the san200-0-9-1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of san200-0-9-1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def CondMat( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CondMat(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cond-mat graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cond-mat graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CondMat",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cond-mat graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cond-mat graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cities( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cities(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Cities graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Cities graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cities",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Cities graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Cities graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Rail4284( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Rail4284(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the rail4284 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of rail4284 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Rail4284",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the rail4284 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of rail4284 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbYale4( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbYale4(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Yale4 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Yale4 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbYale4",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Yale4 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Yale4 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Lshp3466( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Lshp3466(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the lshp3466 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of lshp3466 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Lshp3466",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the lshp3466 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of lshp3466 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def S4dkt3m2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def S4dkt3m2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the s4dkt3m2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of s4dkt3m2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="S4dkt3m2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the s4dkt3m2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of s4dkt3m2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Debr( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Debr(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the debr graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of debr graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Debr",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the debr graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of debr graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Bcspwr04( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcspwr04(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcspwr04 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcspwr04 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcspwr04",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcspwr04 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcspwr04 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G37( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G37(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G37 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G37 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G37",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G37 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G37 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G27( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G27(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G27 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G27 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G27",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G27 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G27 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100030d3Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100030d3Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-3-0d3-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-3-0d3-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100030d3Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-3-0d3-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-3-0d3-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def MaayanStelzl( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def MaayanStelzl(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the maayan-Stelzl graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of maayan-Stelzl graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="MaayanStelzl",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the maayan-Stelzl graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of maayan-Stelzl graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Struct4( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Struct4(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the struct4 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of struct4 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Struct4",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the struct4 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of struct4 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbMich67( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbMich67(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Mich67 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Mich67 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbMich67",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Mich67 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Mich67 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Cl10002d0Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10002d0Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000-2d0-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000-2d0-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10002d0Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000-2d0-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000-2d0-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Kleemin( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Kleemin(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the kleemin graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of kleemin graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Kleemin",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the kleemin graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of kleemin graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Jagmesh9( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Jagmesh9(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the jagmesh9 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of jagmesh9 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Jagmesh9",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the jagmesh9 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of jagmesh9 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Lp1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Lp1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the lp1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of lp1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Lp1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the lp1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of lp1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Trec7( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Trec7(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Trec7 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Trec7 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Trec7",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Trec7 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Trec7 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def PHat7003( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def PHat7003(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the p-hat700-3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of p-hat700-3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="PHat7003",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the p-hat700-3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of p-hat700-3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def AffWikiEnArticleCat( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def AffWikiEnArticleCat(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the aff-wiki-en-article-cat graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of aff-wiki-en-article-cat graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="AffWikiEnArticleCat",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the aff-wiki-en-article-cat graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of aff-wiki-en-article-cat graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cage4( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cage4(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cage4 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cage4 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cage4",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cage4 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cage4 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw1000050d1Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000050d1Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-5-0d1-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-5-0d1-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000050d1Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-5-0d1-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-5-0d1-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbUf( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUf(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-UF graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-UF graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUf",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-UF graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-UF graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Erdos971( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Erdos971(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Erdos971 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Erdos971 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Erdos971",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Erdos971 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Erdos971 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Pkustk03( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pkustk03(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the pkustk03 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of pkustk03 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pkustk03",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the pkustk03 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of pkustk03 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Pkustk13( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pkustk13(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the pkustk13 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of pkustk13 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pkustk13",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the pkustk13 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of pkustk13 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def ScNasasrb( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def ScNasasrb(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the sc-nasasrb graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of sc-nasasrb graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="ScNasasrb",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the sc-nasasrb graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of sc-nasasrb graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}
#   def G55( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G55(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G55 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G55 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G55",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G55 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G55 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G45( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G45(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G45 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G45 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G45",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G45 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G45 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def California( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def California(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the California graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of California graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="California",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the California graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of California graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def RoadLuxembourgOsm( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def RoadLuxembourgOsm(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the road-luxembourg-osm graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of road-luxembourg-osm graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="RoadLuxembourgOsm",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the road-luxembourg-osm graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of road-luxembourg-osm graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl100001d9Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl100001d9Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-10000-1d9-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-10000-1d9-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl100001d9Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-10000-1d9-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-10000-1d9-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100040d2Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100040d2Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-4-0d2-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-4-0d2-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100040d2Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-4-0d2-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-4-0d2-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CaCsphd( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CaCsphd(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ca-CSphd graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ca-CSphd graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@book{de2011exploratory,
	        title={Exploratory social network analysis with Pajek},
	        author={De Nooy, Wouter and Mrvar, Andrej and Batagelj, Vladimir},
	        volume={27},
	        year={2011},
	        publisher={Cambridge University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CaCsphd",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ca-CSphd graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ca-CSphd graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@book{de2011exploratory,
        title={Exploratory social network analysis with Pajek},
        author={De Nooy, Wouter and Mrvar, Andrej and Batagelj, Vladimir},
        volume={27},
        year={2011},
        publisher={Cambridge University Press}
}
#   def UcidataZachary( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def UcidataZachary(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ucidata-zachary graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ucidata-zachary graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="UcidataZachary",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ucidata-zachary graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ucidata-zachary graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl1000002d0Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl1000002d0Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-100000-2d0-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-100000-2d0-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl1000002d0Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-100000-2d0-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-100000-2d0-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocPhysicians( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocPhysicians(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-physicians graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-physicians graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocPhysicians",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-physicians graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-physicians graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocLivejournal1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocLivejournal1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-LiveJournal1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-LiveJournal1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocLivejournal1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-LiveJournal1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-LiveJournal1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Crystm02( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Crystm02(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the crystm02 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of crystm02 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Crystm02",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the crystm02 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of crystm02 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G63( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G63(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G63 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G63 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G63",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G63 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G63 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def NR130bit( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def NR130bit(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the 130bit graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of 130bit graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="NR130bit",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the 130bit graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of 130bit graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbGwu54( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbGwu54(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-GWU54 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-GWU54 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbGwu54",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-GWU54 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-GWU54 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Dblp2010( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Dblp2010(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the dblp-2010 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of dblp-2010 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Dblp2010",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the dblp-2010 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of dblp-2010 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Hamming64( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Hamming64(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the hamming6-4 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of hamming6-4 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Hamming64",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the hamming6-4 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of hamming6-4 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Amazon0601( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Amazon0601(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the amazon0601 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of amazon0601 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Amazon0601",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the amazon0601 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of amazon0601 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocLocBrightkite( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocLocBrightkite(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-loc-brightkite graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-loc-brightkite graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocLocBrightkite",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-loc-brightkite graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-loc-brightkite graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def EmailEnronLarge( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def EmailEnronLarge(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the email-enron-large graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of email-enron-large graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="EmailEnronLarge",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the email-enron-large graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of email-enron-large graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def C40005( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def C40005(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the C4000-5 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of C4000-5 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="C40005",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the C4000-5 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of C4000-5 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Sw1000030d3Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000030d3Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-3-0d3-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-3-0d3-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000030d3Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-3-0d3-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-3-0d3-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocThemarker( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocThemarker(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-themarker graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-themarker graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{Fire2011,
	        title={Link Prediction in Social Networks using Computationally Efficient Topological Features},
	        author={Fire, M. and Tenenboim, L. and Lesser, O. and Puzis, R. and Rokach, L. and Elovici, Y.},
	        booktitle={ IEEE Third International Confernece on Social Computing (SocialCom)},
	        pages={73--80},
	        year={2011},
	        organization={IEEE}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocThemarker",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-themarker graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-themarker graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{Fire2011,
        title={Link Prediction in Social Networks using Computationally Efficient Topological Features},
        author={Fire, M. and Tenenboim, L. and Lesser, O. and Puzis, R. and Rokach, L. and Elovici, Y.},
        booktitle={ IEEE Third International Confernece on Social Computing (SocialCom)},
        pages={73--80},
        year={2011},
        organization={IEEE}
}
#   def InfUsair97( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def InfUsair97(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the inf-USAir97 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of inf-USAir97 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{colizza2007reaction,
	        title={Reaction--diffusion processes and metapopulation models in heterogeneous networks},
	        author={Colizza, Vittoria and Pastor-Satorras, Romualdo and Vespignani, Alessandro},
	        journal={Nature Physics},
	        volume={3},
	        number={4},
	        pages={276--282},
	        year={2007},
	        publisher={Nature Publishing Group}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="InfUsair97",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the inf-USAir97 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of inf-USAir97 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{colizza2007reaction,
        title={Reaction--diffusion processes and metapopulation models in heterogeneous networks},
        author={Colizza, Vittoria and Pastor-Satorras, Romualdo and Vespignani, Alessandro},
        journal={Nature Physics},
        volume={3},
        number={4},
        pages={276--282},
        year={2007},
        publisher={Nature Publishing Group}
}
#   def RoadRoadnetPa( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def RoadRoadnetPa(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the road-roadNet-PA graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of road-roadNet-PA graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="RoadRoadnetPa",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the road-roadNet-PA graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of road-roadNet-PA graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Pli( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pli(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the pli graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of pli graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pli",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the pli graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of pli graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def MaayanVidal( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def MaayanVidal(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the maayan-vidal graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of maayan-vidal graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="MaayanVidal",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the maayan-vidal graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of maayan-vidal graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbUcla( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUcla(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-UCLA graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-UCLA graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUcla",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-UCLA graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-UCLA graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def SocTribes( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocTribes(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-tribes graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-tribes graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{read1954cultures,
	        title={Cultures of the central highlands, New Guinea},
	        author={Read, Kenneth E},
	        journal={Southwestern Journal of Anthropology},
	        pages={1--43},
	        year={1954},
	        publisher={JSTOR}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocTribes",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-tribes graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-tribes graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{read1954cultures,
        title={Cultures of the central highlands, New Guinea},
        author={Read, Kenneth E},
        journal={Southwestern Journal of Anthropology},
        pages={1--43},
        year={1954},
        publisher={JSTOR}
}
#   def Cl10000001d9Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10000001d9Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000000-1d9-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000000-1d9-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10000001d9Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000000-1d9-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000000-1d9-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbAuburn71( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbAuburn71(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Auburn71 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Auburn71 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbAuburn71",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Auburn71 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Auburn71 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Webbase1m( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Webbase1m(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the webbase-1M graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of webbase-1M graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Webbase1m",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the webbase-1M graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of webbase-1M graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Amazon0505( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Amazon0505(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the amazon0505 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of amazon0505 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Amazon0505",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the amazon0505 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of amazon0505 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw1000040d2Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000040d2Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-4-0d2-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-4-0d2-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000040d2Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-4-0d2-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-4-0d2-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def P2pGnutella08( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def P2pGnutella08(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the p2p-Gnutella08 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of p2p-Gnutella08 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="P2pGnutella08",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the p2p-Gnutella08 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of p2p-Gnutella08 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw10060d2Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10060d2Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-6-0d2-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-6-0d2-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10060d2Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-6-0d2-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-6-0d2-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Bcsstm11( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcsstm11(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcsstm11 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcsstm11 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcsstm11",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcsstm11 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcsstm11 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CoPapersDblp( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CoPapersDblp(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the co-papers-dblp graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of co-papers-dblp graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{geisberger2008better,
	        title={Better Approximation of Betweenness Centrality.},
	        author={Geisberger, Robert and Sanders, Peter and Schultes, Dominik},
	        booktitle={ALENEX},
	        pages={90--100},
	        year={2008},
	        organization={SIAM}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CoPapersDblp",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the co-papers-dblp graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of co-papers-dblp graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{geisberger2008better,
        title={Better Approximation of Betweenness Centrality.},
        author={Geisberger, Robert and Sanders, Peter and Schultes, Dominik},
        booktitle={ALENEX},
        pages={90--100},
        year={2008},
        organization={SIAM}
}
#   def SfhhConfSensor( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SfhhConfSensor(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SFHH-conf-sensor graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SFHH-conf-sensor graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{infect,
	        author={{SocioPatterns}},
	        title={Infectious contact networks},
	        url={http://www.sociopatterns.org/datasets/}}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SfhhConfSensor",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SFHH-conf-sensor graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SFHH-conf-sensor graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{infect,
        author={{SocioPatterns}},
        title={Infectious contact networks},
        url={http://www.sociopatterns.org/datasets/}}
#   def Sw1000040d1Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000040d1Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-4-0d1-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-4-0d1-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000040d1Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-4-0d1-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-4-0d1-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cage13( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cage13(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cage13 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cage13 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cage13",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cage13 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cage13 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Enzymes296( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Enzymes296(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ENZYMES296 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ENZYMES296 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Enzymes296",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ENZYMES296 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ENZYMES296 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw10060d1Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10060d1Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-6-0d1-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-6-0d1-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10060d1Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-6-0d1-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-6-0d1-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Epinions( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Epinions(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the epinions graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of epinions graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Epinions",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the epinions graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of epinions graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ig56( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ig56(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the IG5-6 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of IG5-6 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ig56",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the IG5-6 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of IG5-6 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Rgg010( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Rgg010(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the rgg010 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of rgg010 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Rgg010",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the rgg010 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of rgg010 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbTennessee95( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbTennessee95(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Tennessee95 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Tennessee95 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbTennessee95",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Tennessee95 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Tennessee95 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Sw100050d2Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100050d2Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-5-0d2-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-5-0d2-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100050d2Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-5-0d2-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-5-0d2-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Coater1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Coater1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the coater1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of coater1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Coater1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the coater1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of coater1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100050d1Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100050d1Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-5-0d1-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-5-0d1-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100050d1Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-5-0d1-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-5-0d1-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def FlickrGroupmemberships( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def FlickrGroupmemberships(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the flickr-groupmemberships graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of flickr-groupmemberships graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="FlickrGroupmemberships",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the flickr-groupmemberships graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of flickr-groupmemberships graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10000002d1Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10000002d1Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000000-2d1-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000000-2d1-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10000002d1Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000000-2d1-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000000-2d1-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Lesmis( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Lesmis(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the lesmis graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of lesmis graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Lesmis",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the lesmis graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of lesmis graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocEpinions( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocEpinions(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-epinions graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-epinions graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@incollection{richardson2003trust,
	        title={Trust management for the semantic web},
	        author={Richardson, Matthew and Agrawal, Rakesh and Domingos, Pedro},
	        booktitle={The Semantic Web-ISWC 2003},
	        pages={351--368},
	        year={2003},
	        publisher={Springer}
	}
	
	@inproceedings{nr:massa05,
	        title = {Controversial Users Demand Local Trust Metrics: An Experimental Study on epinions.com Community},
	        author = {Paolo Massa and Paolo Avesani},
	        booktitle = {AAAI},
	        year = {2005},
	        pages = {121--126},
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocEpinions",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-epinions graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-epinions graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@incollection{richardson2003trust,
        title={Trust management for the semantic web},
        author={Richardson, Matthew and Agrawal, Rakesh and Domingos, Pedro},
        booktitle={The Semantic Web-ISWC 2003},
        pages={351--368},
        year={2003},
        publisher={Springer}
}

@inproceedings{nr:massa05,
        title = {Controversial Users Demand Local Trust Metrics: An Experimental Study on epinions.com Community},
        author = {Paolo Massa and Paolo Avesani},
        booktitle = {AAAI},
        year = {2005},
        pages = {121--126},
}
#   def G3rmt3m3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G3rmt3m3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the g3rmt3m3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of g3rmt3m3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G3rmt3m3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the g3rmt3m3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of g3rmt3m3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def InfectDublin( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def InfectDublin(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the infect-dublin graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of infect-dublin graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{infect,
	        author={{SocioPatterns}},
	        title={Infectious contact networks},
	        url={http://www.sociopatterns.org/datasets/}}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="InfectDublin",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the infect-dublin graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of infect-dublin graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{infect,
        author={{SocioPatterns}},
        title={Infectious contact networks},
        url={http://www.sociopatterns.org/datasets/}}
#   def Sw100060d3Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100060d3Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-6-0d3-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-6-0d3-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100060d3Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-6-0d3-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-6-0d3-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def FeOcean( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def FeOcean(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the fe-ocean graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of fe-ocean graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="FeOcean",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the fe-ocean graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of fe-ocean graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}
#   def Gen200P0955( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Gen200P0955(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the gen200-p0-9-55 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of gen200-p0-9-55 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Gen200P0955",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the gen200-p0-9-55 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of gen200-p0-9-55 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def G3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Usair97( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Usair97(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the USAir97 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of USAir97 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Usair97",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the USAir97 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of USAir97 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def C2509( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def C2509(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the C250-9 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of C250-9 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="C2509",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the C250-9 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of C250-9 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Cl100001d7Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl100001d7Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-10000-1d7-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-10000-1d7-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl100001d7Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-10000-1d7-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-10000-1d7-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbTemple83( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbTemple83(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Temple83 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Temple83 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbTemple83",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Temple83 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Temple83 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Sanr40005( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sanr40005(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the sanr400-0-5 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of sanr400-0-5 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sanr40005",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the sanr400-0-5 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of sanr400-0-5 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Lederberg( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Lederberg(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Lederberg graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Lederberg graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Lederberg",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Lederberg graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Lederberg graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Lshp1882( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Lshp1882(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the lshp1882 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of lshp1882 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Lshp1882",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the lshp1882 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of lshp1882 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Lock2232( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Lock2232(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the lock2232 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of lock2232 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Lock2232",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the lock2232 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of lock2232 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WebHudong( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebHudong(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-hudong graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-hudong graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{hudong-xing,
	        author    = {Xing Niu and Xinruo Sun and Haofen Wang and Shu Rong and Guilin Qi and Yong Yu},
	        title     = {{Zhishi.me} -- Weaving {Chinese} Linking Open Data},
	        booktitle = {Proc. Int. Semantic Web Conf.},
	        year      = {2011},
	        pages     = {205--220},
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebHudong",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-hudong graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-hudong graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{hudong-xing,
        author    = {Xing Niu and Xinruo Sun and Haofen Wang and Shu Rong and Guilin Qi and Yong Yu},
        title     = {{Zhishi.me} -- Weaving {Chinese} Linking Open Data},
        booktitle = {Proc. Int. Semantic Web Conf.},
        year      = {2011},
        pages     = {205--220},
}
#   def Cl1000001d8Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl1000001d8Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-100000-1d8-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-100000-1d8-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl1000001d8Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-100000-1d8-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-100000-1d8-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw10050d3Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10050d3Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-5-0d3-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-5-0d3-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10050d3Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-5-0d3-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-5-0d3-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Internet( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Internet(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the internet graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of internet graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Internet",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the internet graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of internet graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def DbpediaProducer( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def DbpediaProducer(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the dbpedia-producer graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of dbpedia-producer graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="DbpediaProducer",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the dbpedia-producer graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of dbpedia-producer graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocHamsterster( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocHamsterster(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-hamsterster graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-hamsterster graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{soc-hamsterster,
	        author={Hamsterster},
	        title={Hamsterster social network},
	        note={http://www.hamsterster.com}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocHamsterster",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-hamsterster graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-hamsterster graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{soc-hamsterster,
        author={Hamsterster},
        title={Hamsterster social network},
        note={http://www.hamsterster.com}
}
#   def Net125( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Net125(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the net125 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of net125 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Net125",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the net125 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of net125 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbUciUni( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUciUni(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-uci-uni graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-uci-uni graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUciUni",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-uci-uni graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-uci-uni graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Coauthorsdblp( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Coauthorsdblp(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the coAuthorsDBLP graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of coAuthorsDBLP graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Coauthorsdblp",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the coAuthorsDBLP graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of coAuthorsDBLP graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Keller6( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Keller6(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the keller6 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of keller6 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Keller6",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the keller6 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of keller6 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def FbMessages( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def FbMessages(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the fb-messages graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of fb-messages graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{opsahl2009clustering,
	        title={Clustering in weighted networks},
	        author={Opsahl, T. and Panzarasa, P.},
	        journal={Social networks},
	        volume={31},
	        number={2},
	        pages={155--163},
	        year={2009},
	        publisher={Elsevier}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="FbMessages",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the fb-messages graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of fb-messages graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{opsahl2009clustering,
        title={Clustering in weighted networks},
        author={Opsahl, T. and Panzarasa, P.},
        journal={Social networks},
        volume={31},
        number={2},
        pages={155--163},
        year={2009},
        publisher={Elsevier}
}
#   def SocfbVassar85( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbVassar85(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Vassar85 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Vassar85 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbVassar85",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Vassar85 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Vassar85 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def SocAnybeat( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocAnybeat(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-anybeat graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-anybeat graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{Fire2012,
	        title={Link Prediction in Highly Fractional Data Sets},
	        author={Fire, M., and Puzis, R., and Elovici, Y. },
	        journal={Handbook of Computational Approaches to Counterterrorism},
	        year={2012}publisher={Springer}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocAnybeat",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-anybeat graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-anybeat graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{Fire2012,
        title={Link Prediction in Highly Fractional Data Sets},
        author={Fire, M., and Puzis, R., and Elovici, Y. },
        journal={Handbook of Computational Approaches to Counterterrorism},
        year={2012}publisher={Springer}
}
#   def Brack2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Brack2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the brack2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of brack2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Brack2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the brack2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of brack2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbTrinity100( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbTrinity100(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Trinity100 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Trinity100 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbTrinity100",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Trinity100 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Trinity100 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Aa4( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Aa4(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the aa4 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of aa4 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Aa4",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the aa4 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of aa4 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def RtHiggs( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def RtHiggs(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the rt-higgs graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of rt-higgs graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{de2013anatomy,
	        title={The anatomy of a scientific rumor},
	        author={De Domenico, Manlio and Lima, Antonio and Mougel, Paul and Musolesi, Mirco},
	        journal={Scientific reports},
	        volume={3},
	        year={2013},
	        publisher={Nature Publishing Group}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="RtHiggs",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the rt-higgs graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of rt-higgs graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{de2013anatomy,
        title={The anatomy of a scientific rumor},
        author={De Domenico, Manlio and Lima, Antonio and Mougel, Paul and Musolesi, Mirco},
        journal={Scientific reports},
        volume={3},
        year={2013},
        publisher={Nature Publishing Group}
}
#   def Ex1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ex1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the EX1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of EX1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ex1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the EX1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of EX1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw1000030d3Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000030d3Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-3-0d3-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-3-0d3-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000030d3Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-3-0d3-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-3-0d3-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocSlashdotZoo( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocSlashdotZoo(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-slashdot-zoo graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-slashdot-zoo graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocSlashdotZoo",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-slashdot-zoo graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-slashdot-zoo graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def San400091( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def San400091(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the san400-0-9-1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of san400-0-9-1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="San400091",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the san400-0-9-1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of san400-0-9-1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def PHat5001( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def PHat5001(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the p-hat500-1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of p-hat500-1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="PHat5001",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the p-hat500-1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of p-hat500-1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def SocfbPrinceton12( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbPrinceton12(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Princeton12 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Princeton12 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbPrinceton12",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Princeton12 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Princeton12 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Cl10000001d9Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10000001d9Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000000-1d9-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000000-1d9-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10000001d9Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000000-1d9-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000000-1d9-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def ContiguousUsa( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def ContiguousUsa(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the contiguous-usa graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of contiguous-usa graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="ContiguousUsa",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the contiguous-usa graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of contiguous-usa graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cegb3024( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cegb3024(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cegb3024 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cegb3024 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cegb3024",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cegb3024 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cegb3024 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CitPatents( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CitPatents(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cit-Patents graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cit-Patents graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CitPatents",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cit-Patents graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cit-Patents graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioCeGn( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioCeGn(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-CE-GN graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-CE-GN graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{cho2014wormnet,
	        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
	        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
	        journal={Nucleic acids research},
	        volume={42},
	        number={W1},
	        pages={W76--W82},
	        year={2014},
	        publisher={Oxford University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioCeGn",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-CE-GN graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-CE-GN graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{cho2014wormnet,
        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
        journal={Nucleic acids research},
        volume={42},
        number={W1},
        pages={W76--W82},
        year={2014},
        publisher={Oxford University Press}
}
#   def San1000( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def San1000(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the san1000 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of san1000 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="San1000",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the san1000 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of san1000 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def SocfbAAnon( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbAAnon(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-A-anon graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-A-anon graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbAAnon",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-A-anon graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-A-anon graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Lshp2614( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Lshp2614(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the lshp2614 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of lshp2614 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Lshp2614",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the lshp2614 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of lshp2614 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G62( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G62(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G62 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G62 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G62",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G62 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G62 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Crystm03( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Crystm03(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the crystm03 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of crystm03 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Crystm03",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the crystm03 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of crystm03 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbSyracuse56( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbSyracuse56(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Syracuse56 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Syracuse56 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbSyracuse56",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Syracuse56 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Syracuse56 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Sw100050d2Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100050d2Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-5-0d2-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-5-0d2-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100050d2Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-5-0d2-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-5-0d2-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G10( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G10(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G10 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G10 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G10",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G10 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G10 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Divorce( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Divorce(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the divorce graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of divorce graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Divorce",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the divorce graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of divorce graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def RoadChesapeake( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def RoadChesapeake(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the road-chesapeake graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of road-chesapeake graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="RoadChesapeake",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the road-chesapeake graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of road-chesapeake graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Curtis54( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Curtis54(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the curtis54 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of curtis54 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Curtis54",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the curtis54 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of curtis54 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ig57( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ig57(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the IG5-7 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of IG5-7 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ig57",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the IG5-7 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of IG5-7 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Flickredges( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Flickredges(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the flickrEdges graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of flickrEdges graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Flickredges",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the flickrEdges graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of flickrEdges graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100050d1Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100050d1Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-5-0d1-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-5-0d1-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100050d1Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-5-0d1-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-5-0d1-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocSlashdot0811( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocSlashdot0811(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-Slashdot0811 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-Slashdot0811 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocSlashdot0811",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-Slashdot0811 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-Slashdot0811 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Linux( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Linux(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the linux graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of linux graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Linux",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the linux graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of linux graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw10060d2Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10060d2Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-6-0d2-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-6-0d2-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10060d2Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-6-0d2-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-6-0d2-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def P2pGnutella09( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def P2pGnutella09(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the p2p-Gnutella09 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of p2p-Gnutella09 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="P2pGnutella09",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the p2p-Gnutella09 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of p2p-Gnutella09 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw1000040d2Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000040d2Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-4-0d2-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-4-0d2-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000040d2Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-4-0d2-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-4-0d2-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw10060d1Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10060d1Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-6-0d1-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-6-0d1-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10060d1Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-6-0d1-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-6-0d1-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Enzymes297( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Enzymes297(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ENZYMES297 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ENZYMES297 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Enzymes297",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ENZYMES297 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ENZYMES297 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cage12( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cage12(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cage12 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cage12 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cage12",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cage12 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cage12 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def AffOrkutUser2groups( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def AffOrkutUser2groups(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the aff-orkut-user2groups graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of aff-orkut-user2groups graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{mislove-2007-socialnetworks,
	        author = {Alan Mislove and Massimiliano Marcon and Krishna P. Gummadi and Peter Druschel and Bobby Bhattacharjee},
	        title = {{Measurement and Analysis of Online Social Networks}},
	        booktitle = {IMC},
	        address = {San Diego, CA},
	        month = {October},
	        year = {2007}}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="AffOrkutUser2groups",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the aff-orkut-user2groups graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of aff-orkut-user2groups graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{mislove-2007-socialnetworks,
        author = {Alan Mislove and Massimiliano Marcon and Krishna P. Gummadi and Peter Druschel and Bobby Bhattacharjee},
        title = {{Measurement and Analysis of Online Social Networks}},
        booktitle = {IMC},
        address = {San Diego, CA},
        month = {October},
        year = {2007}}
#   def Sw1000040d1Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000040d1Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-4-0d1-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-4-0d1-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000040d1Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-4-0d1-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-4-0d1-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BNMouseRetina( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BNMouseRetina(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bn-mouse_retina_1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bn-mouse_retina_1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article {bigbrain,
	     author = {Amunts, Katrin and Lepage, Claude and Borgeat, Louis and Mohlberg, Hartmut and Dickscheid, Timo and Rousseau, Marc-{'E}tienne and Bludau,
	Sebastian and Bazin, Pierre-Louis and Lewis, Lindsay B. and Oros-Peusquens, Ana-Maria and Shah, Nadim J. and Lippert, Thomas and Zilles, Karl and Evans, Alan C.},
	     title = {BigBrain: An Ultrahigh-Resolution 3D Human Brain Model},
	     volume = {340},
	     number = {6139},
	     pages = {1472--1475},
	     year = {2013},
	     publisher = {AAAS},
	     journal = {Science}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BNMouseRetina",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bn-mouse_retina_1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bn-mouse_retina_1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article {bigbrain,
     author = {Amunts, Katrin and Lepage, Claude and Borgeat, Louis and Mohlberg, Hartmut and Dickscheid, Timo and Rousseau, Marc-{'E}tienne and Bludau,
Sebastian and Bazin, Pierre-Louis and Lewis, Lindsay B. and Oros-Peusquens, Ana-Maria and Shah, Nadim J. and Lippert, Thomas and Zilles, Karl and Evans, Alan C.},
     title = {BigBrain: An Ultrahigh-Resolution 3D Human Brain Model},
     volume = {340},
     number = {6139},
     pages = {1472--1475},
     year = {2013},
     publisher = {AAAS},
     journal = {Science}
}
#   def LivejournalGroupmemberships( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def LivejournalGroupmemberships(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the livejournal-groupmemberships graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of livejournal-groupmemberships graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="LivejournalGroupmemberships",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the livejournal-groupmemberships graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of livejournal-groupmemberships graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WebIt2004( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebIt2004(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-it-2004 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-it-2004 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@ARTICLE{boldi2004-ubicrawler,
	        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
	        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
	        journal = {Software: Practice \& Experience},
	        year = {2004},
	        volume = {34},
	        pages = {711--726},
	        number = {8}}
	
	@INPROCEEDINGS{Boldi-2011-layered,
	        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
	        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering	for Compressing Social Networks},
	        booktitle = {WWW},
	        year = {2011},
	        pages = {587--596}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebIt2004",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-it-2004 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-it-2004 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@ARTICLE{boldi2004-ubicrawler,
        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
        journal = {Software: Practice \& Experience},
        year = {2004},
        volume = {34},
        pages = {711--726},
        number = {8}}

@INPROCEEDINGS{Boldi-2011-layered,
        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering  for Compressing Social Networks},
        booktitle = {WWW},
        year = {2011},
        pages = {587--596}
}
#   def SocfbUc64( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUc64(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-UC64 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-UC64 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUc64",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-UC64 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-UC64 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def G2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioDmCx( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioDmCx(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-DM-CX graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-DM-CX graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{cho2014wormnet,
	        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
	        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
	        journal={Nucleic acids research},
	        volume={42},
	        number={W1},
	        pages={W76--W82},
	        year={2014},
	        publisher={Oxford University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioDmCx",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-DM-CX graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-DM-CX graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{cho2014wormnet,
        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
        journal={Nucleic acids research},
        volume={42},
        number={W1},
        pages={W76--W82},
        year={2014},
        publisher={Oxford University Press}
}
#   def Sw10050d3Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10050d3Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-5-0d3-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-5-0d3-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10050d3Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-5-0d3-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-5-0d3-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CaDblp2010( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CaDblp2010(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ca-dblp-2010 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ca-dblp-2010 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{BoVWFI,
	        author ={Paolo Boldi and Sebastiano Vigna},
	        title = {The {W}eb{G}raph Framework {I}: {C}ompression Techniques},
	        year = {2004},
	        booktitle= {Proc. of the Thirteenth International World Wide Web Conference (WWW 2004)},
	        address={Manhattan, USA},
	        pages={595--601},
	        publisher={ACM Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CaDblp2010",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ca-dblp-2010 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ca-dblp-2010 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{BoVWFI,
        author ={Paolo Boldi and Sebastiano Vigna},
        title = {The {W}eb{G}raph Framework {I}: {C}ompression Techniques},
        year = {2004},
        booktitle= {Proc. of the Thirteenth International World Wide Web Conference (WWW 2004)},
        address={Manhattan, USA},
        pages={595--601},
        publisher={ACM Press}
}
#   def SocfbPepperdine86( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbPepperdine86(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Pepperdine86 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Pepperdine86 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbPepperdine86",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Pepperdine86 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Pepperdine86 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def WikiEnCat( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WikiEnCat(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the wiki-en-cat graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of wiki-en-cat graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WikiEnCat",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the wiki-en-cat graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of wiki-en-cat graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Reuters911( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Reuters911(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Reuters911 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Reuters911 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Reuters911",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Reuters911 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Reuters911 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10000002d1Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10000002d1Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000000-2d1-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000000-2d1-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10000002d1Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000000-2d1-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000000-2d1-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WebWikiChInternal( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebWikiChInternal(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-wiki-ch-internal graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-wiki-ch-internal graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@incollection{niu2011zhishi,
	        title={{Zhishi.me} -- Weaving Chinese linking open data},
	        author={Niu, Xing and Sun, Xinruo and Wang, Haofen and Rong, Shu and Qi, Guilin and Yu, Yong},
	        booktitle={ISWC},
	        pages={205--220},
	        year={2011},
	        publisher={Springer}}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebWikiChInternal",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-wiki-ch-internal graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-wiki-ch-internal graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@incollection{niu2011zhishi,
        title={{Zhishi.me} -- Weaving Chinese linking open data},
        author={Niu, Xing and Sun, Xinruo and Wang, Haofen and Rong, Shu and Qi, Guilin and Yu, Yong},
        booktitle={ISWC},
        pages={205--220},
        year={2011},
        publisher={Springer}}
#   def Hamming102( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Hamming102(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the hamming10-2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of hamming10-2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Hamming102",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the hamming10-2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of hamming10-2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Crew1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Crew1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the crew1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of crew1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Crew1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the crew1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of crew1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Eris1176( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Eris1176(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the eris1176 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of eris1176 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Eris1176",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the eris1176 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of eris1176 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbUcsb37( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUcsb37(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-UCSB37 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-UCSB37 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUcsb37",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-UCSB37 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-UCSB37 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def BNFlyDrosophilaMedulla( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BNFlyDrosophilaMedulla(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bn-fly-drosophila_medulla_1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bn-fly-drosophila_medulla_1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article {bigbrain,
	     author = {Amunts, Katrin and Lepage, Claude and Borgeat, Louis and Mohlberg, Hartmut and Dickscheid, Timo and Rousseau, Marc-{'E}tienne and Bludau,
	Sebastian and Bazin, Pierre-Louis and Lewis, Lindsay B. and Oros-Peusquens, Ana-Maria and Shah, Nadim J. and Lippert, Thomas and Zilles, Karl and Evans, Alan C.},
	     title = {BigBrain: An Ultrahigh-Resolution 3D Human Brain Model},
	     volume = {340},
	     number = {6139},
	     pages = {1472--1475},
	     year = {2013},
	     publisher = {AAAS},
	     journal = {Science}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BNFlyDrosophilaMedulla",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bn-fly-drosophila_medulla_1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bn-fly-drosophila_medulla_1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article {bigbrain,
     author = {Amunts, Katrin and Lepage, Claude and Borgeat, Louis and Mohlberg, Hartmut and Dickscheid, Timo and Rousseau, Marc-{'E}tienne and Bludau,
Sebastian and Bazin, Pierre-Louis and Lewis, Lindsay B. and Oros-Peusquens, Ana-Maria and Shah, Nadim J. and Lippert, Thomas and Zilles, Karl and Evans, Alan C.},
     title = {BigBrain: An Ultrahigh-Resolution 3D Human Brain Model},
     volume = {340},
     number = {6139},
     pages = {1472--1475},
     year = {2013},
     publisher = {AAAS},
     journal = {Science}
}
#   def Sw100060d3Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100060d3Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-6-0d3-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-6-0d3-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100060d3Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-6-0d3-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-6-0d3-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Gen200P0944( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Gen200P0944(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the gen200-p0-9-44 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of gen200-p0-9-44 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Gen200P0944",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the gen200-p0-9-44 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of gen200-p0-9-44 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Oregon1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Oregon1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Oregon-1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Oregon-1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Oregon1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Oregon-1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Oregon-1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ins2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ins2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ins2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ins2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ins2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ins2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ins2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sk2005( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sk2005(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the sk-2005 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of sk-2005 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sk2005",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the sk-2005 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of sk-2005 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Aa5( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Aa5(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the aa5 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of aa5 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Aa5",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the aa5 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of aa5 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Jagmesh1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Jagmesh1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the jagmesh1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of jagmesh1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Jagmesh1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the jagmesh1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of jagmesh1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocGowalla( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocGowalla(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-gowalla graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-gowalla graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{cho2011friendship,
	        title={Friendship and mobility: user movement in location-based social networks},
	        author={Cho, Eunjoon and Myers, Seth A and Leskovec, Jure},
	        booktitle={Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining},
	        pages={1082--1090},
	        year={2011},
	        organization={ACM}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocGowalla",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-gowalla graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-gowalla graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{cho2011friendship,
        title={Friendship and mobility: user movement in location-based social networks},
        author={Cho, Eunjoon and Myers, Seth A and Leskovec, Jure},
        booktitle={Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining},
        pages={1082--1090},
        year={2011},
        organization={ACM}
}
#   def Tomographic1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Tomographic1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the tomographic1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of tomographic1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Tomographic1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the tomographic1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of tomographic1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Jazz( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Jazz(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the jazz graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of jazz graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Jazz",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the jazz graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of jazz graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CaImdb( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CaImdb(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ca-IMDB graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ca-IMDB graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@book{de2011exploratory,
	        title={Exploratory social network analysis with Pajek},
	        author={De Nooy, Wouter and Mrvar, Andrej and Batagelj, Vladimir},
	        volume={27},
	        year={2011},
	        publisher={Cambridge University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CaImdb",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ca-IMDB graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ca-IMDB graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@book{de2011exploratory,
        title={Exploratory social network analysis with Pajek},
        author={De Nooy, Wouter and Mrvar, Andrej and Batagelj, Vladimir},
        volume={27},
        year={2011},
        publisher={Cambridge University Press}
}
#   def Lshp3025( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Lshp3025(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the lshp3025 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of lshp3025 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Lshp3025",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the lshp3025 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of lshp3025 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Dd687( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Dd687(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the DD687 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of DD687 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Dd687",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the DD687 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of DD687 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def InfContiguousUsa( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def InfContiguousUsa(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the inf-contiguous-usa graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of inf-contiguous-usa graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="InfContiguousUsa",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the inf-contiguous-usa graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of inf-contiguous-usa graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Nw14( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Nw14(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the nw14 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of nw14 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Nw14",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the nw14 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of nw14 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def ArenasJazz( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def ArenasJazz(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the arenas-jazz graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of arenas-jazz graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="ArenasJazz",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the arenas-jazz graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of arenas-jazz graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cyl6( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cyl6(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cyl6 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cyl6 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cyl6",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cyl6 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cyl6 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Scimet( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Scimet(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SciMet graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SciMet graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Scimet",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SciMet graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SciMet graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbSmith60( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbSmith60(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Smith60 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Smith60 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbSmith60",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Smith60 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Smith60 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Gen400P0955( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Gen400P0955(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the gen400-p0-9-55 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of gen400-p0-9-55 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Gen400P0955",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the gen400-p0-9-55 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of gen400-p0-9-55 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def RoadUsroads48( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def RoadUsroads48(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the road-usroads-48 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of road-usroads-48 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="RoadUsroads48",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the road-usroads-48 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of road-usroads-48 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Bcsstm19( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcsstm19(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcsstm19 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcsstm19 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcsstm19",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcsstm19 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcsstm19 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Net50( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Net50(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the net50 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of net50 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Net50",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the net50 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of net50 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Bcsstm09( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcsstm09(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcsstm09 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcsstm09 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcsstm09",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcsstm09 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcsstm09 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def M14b( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def M14b(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the m14b graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of m14b graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="M14b",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the m14b graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of m14b graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Mip1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Mip1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the mip1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of mip1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Mip1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the mip1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of mip1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ford1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ford1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ford1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ford1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ford1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ford1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ford1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Dd21( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Dd21(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the DD21 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of DD21 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Dd21",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the DD21 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of DD21 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioDmela( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioDmela(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-dmela graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-dmela graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{singh2008-isorank-multi,
	        author = {Singh, Rohit and Xu, Jinbo and Berger, Bonnie},
	        title = {Global alignment of multiple protein interaction networks with application to functional orthology detection},
	        journal = {PNAS},
	        year = {2008},
	        volume = {105},
	        pages = {12763-12768},
	        number = {35}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioDmela",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-dmela graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-dmela graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{singh2008-isorank-multi,
        author = {Singh, Rohit and Xu, Jinbo and Berger, Bonnie},
        title = {Global alignment of multiple protein interaction networks with application to functional orthology detection},
        journal = {PNAS},
        year = {2008},
        volume = {105},
        pages = {12763-12768},
        number = {35}
}
#   def Smagri( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Smagri(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SmaGri graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SmaGri graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Smagri",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SmaGri graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SmaGri graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10001d8Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10001d8Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000-1d8-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000-1d8-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10001d8Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000-1d8-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000-1d8-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Harvard500( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Harvard500(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Harvard500 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Harvard500 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Harvard500",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Harvard500 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Harvard500 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Gent113( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Gent113(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the gent113 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of gent113 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Gent113",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the gent113 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of gent113 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Dd349( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Dd349(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the DD349 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of DD349 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Dd349",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the DD349 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of DD349 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Aa03( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Aa03(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the aa03 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of aa03 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Aa03",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the aa03 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of aa03 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def TechAs22july06( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def TechAs22july06(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the tech-as-22july06 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of tech-as-22july06 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="TechAs22july06",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the tech-as-22july06 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of tech-as-22july06 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sanr20007( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sanr20007(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the sanr200-0-7 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of sanr200-0-7 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sanr20007",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the sanr200-0-7 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of sanr200-0-7 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Brock2003( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Brock2003(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the brock200-3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of brock200-3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Brock2003",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the brock200-3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of brock200-3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Enzymes123( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Enzymes123(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ENZYMES123 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ENZYMES123 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Enzymes123",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ENZYMES123 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ENZYMES123 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Tf15( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Tf15(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the TF15 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of TF15 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Tf15",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the TF15 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of TF15 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioScLc( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioScLc(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-SC-LC graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-SC-LC graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{cho2014wormnet,
	        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
	        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
	        journal={Nucleic acids research},
	        volume={42},
	        number={W1},
	        pages={W76--W82},
	        year={2014},
	        publisher={Oxford University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioScLc",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-SC-LC graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-SC-LC graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{cho2014wormnet,
        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
        journal={Nucleic acids research},
        volume={42},
        number={W1},
        pages={W76--W82},
        year={2014},
        publisher={Oxford University Press}
}
#   def SocSlashdot0902( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocSlashdot0902(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-Slashdot0902 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-Slashdot0902 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocSlashdot0902",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-Slashdot0902 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-Slashdot0902 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl100002d1Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl100002d1Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-10000-2d1-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-10000-2d1-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl100002d1Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-10000-2d1-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-10000-2d1-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Wing( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Wing(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the wing graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of wing graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Wing",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the wing graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of wing graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}
#   def Sw10030d1Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10030d1Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-3-0d1-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-3-0d1-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10030d1Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-3-0d1-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-3-0d1-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def NR192bit( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def NR192bit(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the 192bit graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of 192bit graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="NR192bit",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the 192bit graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of 192bit graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ig517( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ig517(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the IG5-17 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of IG5-17 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ig517",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the IG5-17 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of IG5-17 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Rajat07( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Rajat07(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the rajat07 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of rajat07 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Rajat07",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the rajat07 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of rajat07 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Eu2005( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Eu2005(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the eu-2005 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of eu-2005 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Eu2005",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the eu-2005 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of eu-2005 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Jagmesh8( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Jagmesh8(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the jagmesh8 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of jagmesh8 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Jagmesh8",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the jagmesh8 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of jagmesh8 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Brock8001( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Brock8001(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the brock800-1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of brock800-1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Brock8001",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the brock800-1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of brock800-1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Erdos02( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Erdos02(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Erdos02 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Erdos02 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Erdos02",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Erdos02 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Erdos02 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CoPapersCiteseer( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CoPapersCiteseer(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the co-papers-citeseer graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of co-papers-citeseer graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{geisberger2008better,
	        title={Better Approximation of Betweenness Centrality.},
	        author={Geisberger, Robert and Sanders, Peter and Schultes, Dominik},
	        booktitle={ALENEX},
	        pages={90--100},
	        year={2008},
	        organization={SIAM}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CoPapersCiteseer",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the co-papers-citeseer graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of co-papers-citeseer graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{geisberger2008better,
        title={Better Approximation of Betweenness Centrality.},
        author={Geisberger, Robert and Sanders, Peter and Schultes, Dominik},
        booktitle={ALENEX},
        pages={90--100},
        year={2008},
        organization={SIAM}
}
#   def Cl10002d0Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10002d0Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000-2d0-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000-2d0-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10002d0Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000-2d0-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000-2d0-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Bcsstm26( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcsstm26(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcsstm26 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcsstm26 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcsstm26",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcsstm26 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcsstm26 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Trec6( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Trec6(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Trec6 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Trec6 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Trec6",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Trec6 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Trec6 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def TechAsSkitter( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def TechAsSkitter(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the tech-as-skitter graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of tech-as-skitter graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{skitter,
	    title={Skitter},
	    author={{CAIDA}},
	    note={{http://caida.org/tools/measurement/skitter/}}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="TechAsSkitter",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the tech-as-skitter graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of tech-as-skitter graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{skitter,
    title={Skitter},
    author={{CAIDA}},
    note={{http://caida.org/tools/measurement/skitter/}}
}
#   def WebArabic2005( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebArabic2005(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-arabic-2005 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-arabic-2005 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@ARTICLE{boldi2004-ubicrawler,
	        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
	        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
	        journal = {Software: Practice \& Experience},
	        year = {2004},
	        volume = {34},
	        pages = {711--726},
	        number = {8}}
	
	@INPROCEEDINGS{Boldi-2011-layered,
	        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
	        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering	for Compressing Social Networks},
	        booktitle = {WWW},
	        year = {2011},
	        pages = {587--596}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebArabic2005",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-arabic-2005 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-arabic-2005 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@ARTICLE{boldi2004-ubicrawler,
        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
        journal = {Software: Practice \& Experience},
        year = {2004},
        volume = {34},
        pages = {711--726},
        number = {8}}

@INPROCEEDINGS{Boldi-2011-layered,
        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering  for Compressing Social Networks},
        booktitle = {WWW},
        year = {2011},
        pages = {587--596}
}
#   def CitDblp( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CitDblp(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cit-DBLP graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cit-DBLP graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CitDblp",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cit-DBLP graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cit-DBLP graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WikiTalk( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WikiTalk(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the wiki-Talk graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of wiki-Talk graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WikiTalk",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the wiki-Talk graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of wiki-Talk graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Lshp1009( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Lshp1009(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the lshp1009 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of lshp1009 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Lshp1009",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the lshp1009 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of lshp1009 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbLehigh96( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbLehigh96(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Lehigh96 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Lehigh96 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbLehigh96",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Lehigh96 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Lehigh96 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def AffDbpediaUsers2country( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def AffDbpediaUsers2country(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the aff-dbpedia-users2country graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of aff-dbpedia-users2country graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="AffDbpediaUsers2country",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the aff-dbpedia-users2country graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of aff-dbpedia-users2country graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbTulane29( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbTulane29(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Tulane29 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Tulane29 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbTulane29",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Tulane29 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Tulane29 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def MannA45( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def MannA45(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the MANN-a45 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of MANN-a45 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="MannA45",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the MANN-a45 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of MANN-a45 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def G26( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G26(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G26 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G26 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G26",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G26 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G26 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def NR598a( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def NR598a(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the 598a graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of 598a graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="NR598a",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the 598a graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of 598a graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def DbpediaAll( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def DbpediaAll(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the dbpedia-all graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of dbpedia-all graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="DbpediaAll",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the dbpedia-all graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of dbpedia-all graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Bcspwr05( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcspwr05(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcspwr05 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcspwr05 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcspwr05",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcspwr05 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcspwr05 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cegb3306( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cegb3306(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cegb3306 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cegb3306 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cegb3306",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cegb3306 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cegb3306 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G36( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G36(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G36 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G36 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G36",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G36 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G36 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Pf2177( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pf2177(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the pf2177 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of pf2177 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pf2177",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the pf2177 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of pf2177 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def MannA27( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def MannA27(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the MANN-a27 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of MANN-a27 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="MannA27",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the MANN-a27 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of MANN-a27 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def SocLivejournal07( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocLivejournal07(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-livejournal07 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-livejournal07 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocLivejournal07",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-livejournal07 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-livejournal07 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbGeorgetown15( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbGeorgetown15(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Georgetown15 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Georgetown15 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbGeorgetown15",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Georgetown15 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Georgetown15 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Sw100040d1Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100040d1Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-4-0d1-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-4-0d1-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100040d1Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-4-0d1-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-4-0d1-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G44( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G44(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G44 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G44 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G44",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G44 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G44 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G54( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G54(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G54 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G54 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G54",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G54 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G54 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Odlis( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Odlis(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ODLIS graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ODLIS graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Odlis",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ODLIS graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ODLIS graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl100001d9Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl100001d9Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-10000-1d9-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-10000-1d9-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl100001d9Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-10000-1d9-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-10000-1d9-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cage5( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cage5(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cage5 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cage5 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cage5",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cage5 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cage5 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def PHat7002( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def PHat7002(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the p-hat700-2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of p-hat700-2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="PHat7002",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the p-hat700-2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of p-hat700-2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def DbpediaStarring( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def DbpediaStarring(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the dbpedia-starring graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of dbpedia-starring graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="DbpediaStarring",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the dbpedia-starring graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of dbpedia-starring graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw1000050d2Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000050d2Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-5-0d2-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-5-0d2-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000050d2Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-5-0d2-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-5-0d2-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WebSpam( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebSpam(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-spam graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-spam graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{castillo2008web,
	        title={Web spam challenge 2008},
	        author={Castillo, Carlos and Chellapilla, Kumar and Denoyer, Ludovic},
	        booktitle={Proceedings of the 4th International Workshop on Adversarial Information Retrieval on the Web (AIRWeb)},
	        year={2008}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebSpam",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-spam graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-spam graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{castillo2008web,
        title={Web spam challenge 2008},
        author={Castillo, Carlos and Chellapilla, Kumar and Denoyer, Ludovic},
        booktitle={Proceedings of the 4th International Workshop on Adversarial Information Retrieval on the Web (AIRWeb)},
        year={2008}
}
#   def Pkustk12( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pkustk12(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the pkustk12 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of pkustk12 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pkustk12",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the pkustk12 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of pkustk12 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WebBaiduBaike( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebBaiduBaike(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-baidu-baike graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-baidu-baike graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@incollection{niu2011zhishi,
	        title={{Zhishi.me} -- Weaving Chinese linking open data},
	        author={Niu, Xing and Sun, Xinruo and Wang, Haofen and Rong, Shu and Qi, Guilin and Yu, Yong},
	        booktitle={ISWC},
	        pages={205--220},
	        year={2011},
	        publisher={Springer}}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebBaiduBaike",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-baidu-baike graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-baidu-baike graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@incollection{niu2011zhishi,
        title={{Zhishi.me} -- Weaving Chinese linking open data},
        author={Niu, Xing and Sun, Xinruo and Wang, Haofen and Rong, Shu and Qi, Guilin and Yu, Yong},
        booktitle={ISWC},
        pages={205--220},
        year={2011},
        publisher={Springer}}
#   def Pkustk02( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pkustk02(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the pkustk02 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of pkustk02 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pkustk02",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the pkustk02 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of pkustk02 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WebClueweb09( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebClueweb09(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-ClueWeb09 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-ClueWeb09 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@techreport{clarke2009overview,
	        title={Overview of the trec 2009 web track},
	        author={Clarke, Charles L and Craswell, Nick and Soboroff, Ian},
	        year={2009},
	        institution={DTIC Document}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebClueweb09",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-ClueWeb09 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-ClueWeb09 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@techreport{clarke2009overview,
        title={Overview of the trec 2009 web track},
        author={Clarke, Charles L and Craswell, Nick and Soboroff, Ian},
        year={2009},
        institution={DTIC Document}
}
#   def WebCc12Payleveldomain( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebCc12Payleveldomain(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-cc12-PayLevelDomain graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-cc12-PayLevelDomain graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{meusel2014graph,
	        title={Graph structure in the web---revisited: a trick of the heavy tail},
	        author={Meusel, Robert and Vigna, Sebastiano and Lehmberg, Oliver and Bizer, Christian},
	        booktitle={WWW Companion},
	        pages={427--432},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebCc12Payleveldomain",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-cc12-PayLevelDomain graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-cc12-PayLevelDomain graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{meusel2014graph,
        title={Graph structure in the web---revisited: a trick of the heavy tail},
        author={Meusel, Robert and Vigna, Sebastiano and Lehmberg, Oliver and Bizer, Christian},
        booktitle={WWW Companion},
        pages={427--432},
        year={2014}
}
#   def SocfbBingham82( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbBingham82(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Bingham82 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Bingham82 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbBingham82",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Bingham82 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Bingham82 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def BioYeast( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioYeast(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-yeast graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-yeast graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{jeong2001lethality,
	        title={Lethality and centrality in protein networks},
	        author={Jeong, H. and Mason, S.P. and Barabasi, A.L. and Oltvai, Z.N.},
	        journal={arXiv preprint cond-mat/0105306},
	        year={2001}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioYeast",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-yeast graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-yeast graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{jeong2001lethality,
        title={Lethality and centrality in protein networks},
        author={Jeong, H. and Mason, S.P. and Barabasi, A.L. and Oltvai, Z.N.},
        journal={arXiv preprint cond-mat/0105306},
        year={2001}
}
#   def CiteulikeUi( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CiteulikeUi(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the citeulike-ui graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of citeulike-ui graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CiteulikeUi",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the citeulike-ui graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of citeulike-ui graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CiteulikeTi( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CiteulikeTi(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the citeulike-ti graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of citeulike-ti graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CiteulikeTi",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the citeulike-ti graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of citeulike-ti graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Lpl1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Lpl1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the lpl1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of lpl1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Lpl1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the lpl1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of lpl1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioScGt( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioScGt(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-SC-GT graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-SC-GT graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{cho2014wormnet,
	        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
	        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
	        journal={Nucleic acids research},
	        volume={42},
	        number={W1},
	        pages={W76--W82},
	        year={2014},
	        publisher={Oxford University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioScGt",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-SC-GT graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-SC-GT graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{cho2014wormnet,
        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
        journal={Nucleic acids research},
        volume={42},
        number={W1},
        pages={W76--W82},
        year={2014},
        publisher={Oxford University Press}
}
#   def Sw100050d2Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100050d2Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-5-0d2-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-5-0d2-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100050d2Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-5-0d2-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-5-0d2-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Coater2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Coater2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the coater2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of coater2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Coater2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the coater2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of coater2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CopresenceLyonschool( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CopresenceLyonschool(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the copresence-LyonSchool graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of copresence-LyonSchool graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{infect,
	        author={{SocioPatterns}},
	        title={Infectious contact networks},
	        url={http://www.sociopatterns.org/datasets/}}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CopresenceLyonschool",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the copresence-LyonSchool graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of copresence-LyonSchool graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{infect,
        author={{SocioPatterns}},
        title={Infectious contact networks},
        url={http://www.sociopatterns.org/datasets/}}
#   def Cage10( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cage10(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cage10 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cage10 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cage10",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cage10 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cage10 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw1000040d1Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000040d1Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-4-0d1-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-4-0d1-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000040d1Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-4-0d1-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-4-0d1-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Enzymes295( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Enzymes295(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ENZYMES295 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ENZYMES295 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Enzymes295",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ENZYMES295 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ENZYMES295 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw10060d1Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10060d1Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-6-0d1-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-6-0d1-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10060d1Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-6-0d1-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-6-0d1-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CaHepph( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CaHepph(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ca-HepPh graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ca-HepPh graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CaHepph",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ca-HepPh graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ca-HepPh graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WebWebbase2001All( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebWebbase2001All(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-webbase-2001-all graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-webbase-2001-all graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@ARTICLE{boldi2004-ubicrawler,
	        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
	        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
	        journal = {Software: Practice \& Experience},
	        year = {2004},
	        volume = {34},
	        pages = {711--726},
	        number = {8}}
	
	@INPROCEEDINGS{Boldi-2011-layered,
	        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
	        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering	for Compressing Social Networks},
	        booktitle = {WWW},
	        year = {2011},
	        pages = {587--596}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebWebbase2001All",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-webbase-2001-all graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-webbase-2001-all graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@ARTICLE{boldi2004-ubicrawler,
        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
        journal = {Software: Practice \& Experience},
        year = {2004},
        volume = {34},
        pages = {711--726},
        number = {8}}

@INPROCEEDINGS{Boldi-2011-layered,
        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering  for Compressing Social Networks},
        booktitle = {WWW},
        year = {2011},
        pages = {587--596}
}
#   def Bcsstm02( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcsstm02(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcsstm02 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcsstm02 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcsstm02",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcsstm02 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcsstm02 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def NR176bit( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def NR176bit(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the 176bit graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of 176bit graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="NR176bit",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the 176bit graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of 176bit graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def EmailEnron( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def EmailEnron(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the email-enron graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of email-enron graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@        Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Category 	= Collection 	= Tags 		= Data source 	=	Short 		=Vertex type 	=	Edge type 	=	Format 		=Edge weights 	=Metadata 	=Description 	=bibtex =Name = Enron Email CommunicationsCategory = 	Collection = 	Tags = 	directed graphData source = 	Author = 	L. Kaelbling,
	M. Gervasio,         W. CohenDate = 	2003Short = 	Vertex type = Enron Employees / individualsEdge type = Email communications between individualsFormat = 	Edge weights = 	UnweightedMetadata = 	directed graphDescription = 	Email communication network from Enronbibtex = 	 emails sent between employees of Enron. Nodes in the network are individual employees and edges are individual emails.bibtex =,
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	
	@misc{cohen2005enron,
	        title={Enron email dataset},
	        author={Cohen, W.},
	        note={http://www.cs.cmu.edu/~enron/}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="EmailEnron",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the email-enron graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of email-enron graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@        Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Category       = Collection    = Tags          = Data source   =       Short           =Vertex type    =       Edge type       =       Format          =Edge weights   =Metadata       =Description    =bibtex =Name = Enron Email CommunicationsCategory =    Collection =    Tags =  directed graphData source =     Author =        L. Kaelbling,
M. Gervasio,         W. CohenDate =     2003Short =     Vertex type = Enron Employees / individualsEdge type = Email communications between individualsFormat =         Edge weights =  UnweightedMetadata =    directed graphDescription =     Email communication network from Enronbibtex =   emails sent between employees of Enron. Nodes in the network are individual employees and edges are individual emails.bibtex =,

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}

@misc{cohen2005enron,
        title={Enron email dataset},
        author={Cohen, W.},
        note={http://www.cs.cmu.edu/~enron/}
}
#   def PHat5003( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def PHat5003(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the p-hat500-3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of p-hat500-3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="PHat5003",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the p-hat500-3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of p-hat500-3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def PrimarySchoolProximity( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def PrimarySchoolProximity(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the primary-school-proximity graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of primary-school-proximity graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{infect,
	        author={{SocioPatterns}},
	        title={Infectious contact networks},
	        url={http://www.sociopatterns.org/datasets/}}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="PrimarySchoolProximity",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the primary-school-proximity graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of primary-school-proximity graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{infect,
        author={{SocioPatterns}},
        title={Infectious contact networks},
        url={http://www.sociopatterns.org/datasets/}}
#   def SocfbWilliam77( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbWilliam77(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-William77 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-William77 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbWilliam77",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-William77 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-William77 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Air02( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Air02(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the air02 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of air02 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Air02",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the air02 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of air02 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbUmass92( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUmass92(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-UMass92 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-UMass92 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUmass92",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-UMass92 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-UMass92 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Minnesota( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Minnesota(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the minnesota graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of minnesota graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Minnesota",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the minnesota graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of minnesota graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Smallw( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Smallw(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SmallW graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SmallW graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Smallw",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SmallW graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SmallW graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Crystm01( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Crystm01(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the crystm01 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of crystm01 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Crystm01",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the crystm01 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of crystm01 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def OpsahlOpenflights( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def OpsahlOpenflights(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the opsahl-openflights graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of opsahl-openflights graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="OpsahlOpenflights",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the opsahl-openflights graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of opsahl-openflights graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G60( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G60(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G60 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G60 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G60",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G60 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G60 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Friendster( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Friendster(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the friendster graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of friendster graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Friendster",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the friendster graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of friendster graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocCatster( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocCatster(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-catster graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-catster graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{soc-catster,
	        author={Catster},
	        title={Catster social network},
	        note={http://www.catster.com}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocCatster",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-catster graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-catster graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{soc-catster,
        author={Catster},
        title={Catster social network},
        note={http://www.catster.com}
}
#   def L( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def L(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the L graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of L graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="L",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the L graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of L graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl1000002d0Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl1000002d0Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-100000-2d0-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-100000-2d0-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl1000002d0Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-100000-2d0-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-100000-2d0-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Livejournal( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Livejournal(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the livejournal graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of livejournal graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Livejournal",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the livejournal graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of livejournal graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def P2pGnutella24( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def P2pGnutella24(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the p2p-Gnutella24 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of p2p-Gnutella24 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="P2pGnutella24",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the p2p-Gnutella24 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of p2p-Gnutella24 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ex2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ex2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the EX2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of EX2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ex2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the EX2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of EX2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def T03314l( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def T03314l(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the t0331-4l graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of t0331-4l graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="T03314l",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the t0331-4l graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of t0331-4l graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Enron( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Enron(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the enron graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of enron graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Enron",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the enron graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of enron graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Jagmesh3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Jagmesh3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the jagmesh3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of jagmesh3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Jagmesh3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the jagmesh3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of jagmesh3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbMississippi66( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbMississippi66(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Mississippi66 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Mississippi66 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbMississippi66",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Mississippi66 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Mississippi66 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Keller5( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Keller5(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the keller5 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of keller5 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Keller5",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the keller5 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of keller5 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Csphd( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Csphd(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CSphd graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CSphd graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Csphd",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CSphd graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CSphd graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioGridYeast( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioGridYeast(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-grid-yeast graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-grid-yeast graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioGridYeast",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-grid-yeast graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-grid-yeast graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def TechIp( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def TechIp(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the tech-ip graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of tech-ip graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="TechIp",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the tech-ip graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of tech-ip graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def C1259( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def C1259(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the C125-9 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of C125-9 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="C1259",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the C125-9 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of C125-9 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def SocfbMiddlebury45( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbMiddlebury45(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Middlebury45 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Middlebury45 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbMiddlebury45",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Middlebury45 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Middlebury45 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def SocLivemocha( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocLivemocha(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-LiveMocha graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-LiveMocha graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{zafarani2014users,
	        title={Users Joining Multiple Sites: Distributions and Patterns},
	        author={Zafarani, Reza and Liu, Huan},
	        booktitle = {Proceedings of the 8th International AAAI Conference on Weblogs and Social Media (ICWSM'14)},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocLivemocha",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-LiveMocha graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-LiveMocha graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{zafarani2014users,
        title={Users Joining Multiple Sites: Distributions and Patterns},
        author={Zafarani, Reza and Liu, Huan},
        booktitle = {Proceedings of the 8th International AAAI Conference on Weblogs and Social Media (ICWSM'14)},
        year={2014}
}
#   def Trec14( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Trec14(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Trec14 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Trec14 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Trec14",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Trec14 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Trec14 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def InfectHyper( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def InfectHyper(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the infect-hyper graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of infect-hyper graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{infect,
	        author={{SocioPatterns}},
	        title={Infectious contact networks},
	        url={http://www.sociopatterns.org/datasets/}}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="InfectHyper",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the infect-hyper graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of infect-hyper graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{infect,
        author={{SocioPatterns}},
        title={Infectious contact networks},
        url={http://www.sociopatterns.org/datasets/}}
#   def NR144( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def NR144(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the 144 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of 144 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="NR144",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the 144 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of 144 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl1000001d8Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl1000001d8Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-100000-1d8-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-100000-1d8-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl1000001d8Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-100000-1d8-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-100000-1d8-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw10050d3Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10050d3Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-5-0d3-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-5-0d3-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10050d3Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-5-0d3-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-5-0d3-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CaDblp2012( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CaDblp2012(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ca-dblp-2012 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ca-dblp-2012 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{BoVWFI,
	        author ={Paolo Boldi and Sebastiano Vigna},
	        title = {The {W}eb{G}raph Framework {I}: {C}ompression Techniques},
	        year = {2004},
	        booktitle= {Proc. of the Thirteenth International World Wide Web Conference (WWW 2004)},
	        address={Manhattan, USA},
	        pages={595--601},
	        publisher={ACM Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CaDblp2012",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ca-dblp-2012 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ca-dblp-2012 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{BoVWFI,
        author ={Paolo Boldi and Sebastiano Vigna},
        title = {The {W}eb{G}raph Framework {I}: {C}ompression Techniques},
        year = {2004},
        booktitle= {Proc. of the Thirteenth International World Wide Web Conference (WWW 2004)},
        address={Manhattan, USA},
        pages={595--601},
        publisher={ACM Press}
}
#   def CopresenceLh10( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CopresenceLh10(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the copresence-LH10 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of copresence-LH10 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{infect,
	        author={{SocioPatterns}},
	        title={Infectious contact networks},
	        url={http://www.sociopatterns.org/datasets/}}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CopresenceLh10",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the copresence-LH10 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of copresence-LH10 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{infect,
        author={{SocioPatterns}},
        title={Infectious contact networks},
        url={http://www.sociopatterns.org/datasets/}}
#   def Ash219( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ash219(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ash219 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ash219 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ash219",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ash219 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ash219 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl100001d7Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl100001d7Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-10000-1d7-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-10000-1d7-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl100001d7Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-10000-1d7-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-10000-1d7-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocWikiTalkDir( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocWikiTalkDir(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-wiki-Talk-dir graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-wiki-Talk-dir graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{leskovec2010signed,
	        title={Signed networks in social media},
	        author={Leskovec, Jure and Huttenlocher, Daniel and Kleinberg, Jon},
	        booktitle={Proceedings of the SIGCHI Conference on Human Factors in Computing Systems},
	        pages={1361--1370},
	        year={2010},
	        organization={ACM}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocWikiTalkDir",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-wiki-Talk-dir graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-wiki-Talk-dir graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{leskovec2010signed,
        title={Signed networks in social media},
        author={Leskovec, Jure and Huttenlocher, Daniel and Kleinberg, Jon},
        booktitle={Proceedings of the SIGCHI Conference on Human Factors in Computing Systems},
        pages={1361--1370},
        year={2010},
        organization={ACM}
}
#   def L9( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def L9(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the L-9 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of L-9 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="L9",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the L-9 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of L-9 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Dbpedia( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Dbpedia(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the dbpedia graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of dbpedia graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Dbpedia",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the dbpedia graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of dbpedia graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Pkustk09( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pkustk09(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the pkustk09 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of pkustk09 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pkustk09",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the pkustk09 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of pkustk09 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CaOpsahlCollaboration( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CaOpsahlCollaboration(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ca-opsahl-collaboration graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ca-opsahl-collaboration graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CaOpsahlCollaboration",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ca-opsahl-collaboration graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ca-opsahl-collaboration graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Crplat2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Crplat2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the crplat2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of crplat2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Crplat2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the crplat2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of crplat2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Dd6( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Dd6(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the DD6 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of DD6 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Dd6",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the DD6 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of DD6 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Eat( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Eat(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the eat graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of eat graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Eat",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the eat graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of eat graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def EmailDncCorecipient( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def EmailDncCorecipient(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the email-dnc-corecipient graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of email-dnc-corecipient graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="EmailDncCorecipient",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the email-dnc-corecipient graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of email-dnc-corecipient graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Aa01( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Aa01(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the aa01 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of aa01 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Aa01",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the aa01 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of aa01 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Adaptive( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Adaptive(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the adaptive graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of adaptive graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Adaptive",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the adaptive graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of adaptive graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10000001d7Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10000001d7Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000000-1d7-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000000-1d7-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10000001d7Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000000-1d7-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000000-1d7-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioHsHt( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioHsHt(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-HS-HT graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-HS-HT graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{cho2014wormnet,
	        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
	        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
	        journal={Nucleic acids research},
	        volume={42},
	        number={W1},
	        pages={W76--W82},
	        year={2014},
	        publisher={Oxford University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioHsHt",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-HS-HT graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-HS-HT graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{cho2014wormnet,
        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
        journal={Nucleic acids research},
        volume={42},
        number={W1},
        pages={W76--W82},
        year={2014},
        publisher={Oxford University Press}
}
#   def RoadBelgiumOsm( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def RoadBelgiumOsm(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the road-belgium-osm graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of road-belgium-osm graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="RoadBelgiumOsm",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the road-belgium-osm graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of road-belgium-osm graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ig515( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ig515(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the IG5-15 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of IG5-15 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ig515",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the IG5-15 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of IG5-15 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CaCiteseer( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CaCiteseer(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ca-citeseer graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ca-citeseer graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{geisberger2008better,
	        title={Better Approximation of Betweenness Centrality.},
	        author={Geisberger, Robert and Sanders, Peter and Schultes, Dominik},
	        booktitle={ALENEX},
	        pages={90--100},
	        year={2008},
	        organization={SIAM}
	}
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CaCiteseer",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ca-citeseer graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ca-citeseer graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{geisberger2008better,
        title={Better Approximation of Betweenness Centrality.},
        author={Geisberger, Robert and Sanders, Peter and Schultes, Dominik},
        booktitle={ALENEX},
        pages={90--100},
        year={2008},
        organization={SIAM}
}

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}
#   def Sw10030d1Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10030d1Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-3-0d1-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-3-0d1-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10030d1Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-3-0d1-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-3-0d1-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocBlogcatalogAsu( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocBlogcatalogAsu(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-BlogCatalog-ASU graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-BlogCatalog-ASU graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocBlogcatalogAsu",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-BlogCatalog-ASU graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-BlogCatalog-ASU graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def ComDblp( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def ComDblp(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the com-dblp graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of com-dblp graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="ComDblp",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the com-dblp graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of com-dblp graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw10030d2Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10030d2Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-3-0d2-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-3-0d2-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10030d2Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-3-0d2-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-3-0d2-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Tf17( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Tf17(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the TF17 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of TF17 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Tf17",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the TF17 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of TF17 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Brock2001( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Brock2001(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the brock200-1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of brock200-1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Brock2001",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the brock200-1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of brock200-1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}
#   def Net100( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Net100(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the net100 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of net100 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Net100",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the net100 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of net100 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def San400051( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def San400051(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the san400-0-5-1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of san400-0-5-1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="San400051",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the san400-0-5-1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of san400-0-5-1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Rw5151( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Rw5151(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the rw5151 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of rw5151 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Rw5151",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the rw5151 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of rw5151 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def EgoFacebook( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def EgoFacebook(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ego-facebook graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ego-facebook graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="EgoFacebook",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ego-facebook graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ego-facebook graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbSwarthmore42( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbSwarthmore42(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Swarthmore42 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Swarthmore42 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbSwarthmore42",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Swarthmore42 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Swarthmore42 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Sw10040d3Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10040d3Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-4-0d3-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-4-0d3-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10040d3Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-4-0d3-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-4-0d3-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WebBaiduBaikeRelated( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebBaiduBaikeRelated(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-baidu-baike-related graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-baidu-baike-related graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@incollection{niu2011zhishi,
	        title={{Zhishi.me} -- Weaving Chinese linking open data},
	        author={Niu, Xing and Sun, Xinruo and Wang, Haofen and Rong, Shu and Qi, Guilin and Yu, Yong},
	        booktitle={ISWC},
	        pages={205--220},
	        year={2011},
	        publisher={Springer}}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebBaiduBaikeRelated",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-baidu-baike-related graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@incollection{niu2011zhishi,
        title={{Zhishi.me} -- Weaving Chinese linking open data},
        author={Niu, Xing and Sun, Xinruo and Wang, Haofen and Rong, Shu and Qi, Guilin and Yu, Yong},
        booktitle={ISWC},
        pages={205--220},
        year={2011},
        publisher={Springer}}
#   def SocOrkutDir( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocOrkutDir(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-orkut-dir graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-orkut-dir graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{mislove-2007-socialnetworks,
	        author = {Alan Mislove and Massimiliano Marcon and Krishna P. Gummadi and Peter Druschel and Bobby Bhattacharjee},
	        title = {{Measurement and Analysis of Online Social Networks}},
	        booktitle = {Proceedings of the 5th ACM/Usenix Internet Measurement Conference (IMC'07)},
	        address = {San Diego, CA},
	        month = {October},
	        year = {2007}}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocOrkutDir",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-orkut-dir graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-orkut-dir graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{mislove-2007-socialnetworks,
        author = {Alan Mislove and Massimiliano Marcon and Krishna P. Gummadi and Peter Druschel and Bobby Bhattacharjee},
        title = {{Measurement and Analysis of Online Social Networks}},
        booktitle = {Proceedings of the 5th ACM/Usenix Internet Measurement Conference (IMC'07)},
        address = {San Diego, CA},
        month = {October},
        year = {2007}}
#   def Sw1000060d3Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000060d3Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-6-0d3-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-6-0d3-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000060d3Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-6-0d3-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-6-0d3-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WebGoogle( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebGoogle(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-google graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-google graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{leskovec2009community,
	        title={Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters},
	        author={Leskovec, Jure and Lang, Kevin J and Dasgupta, Anirban and Mahoney, Michael W},
	        journal={Internet Mathematics},
	        volume={6},
	        number={1},
	        pages={29--123},
	        year={2009},
	        publisher={Taylor \& Francis}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebGoogle",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-google graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-google graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{leskovec2009community,
        title={Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters},
        author={Leskovec, Jure and Lang, Kevin J and Dasgupta, Anirban and Mahoney, Michael W},
        journal={Internet Mathematics},
        volume={6},
        number={1},
        pages={29--123},
        year={2009},
        publisher={Taylor \& Francis}
}
#   def BioGridPlant( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioGridPlant(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-grid-plant graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-grid-plant graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioGridPlant",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-grid-plant graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-grid-plant graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ukerbe1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ukerbe1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ukerbe1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ukerbe1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ukerbe1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ukerbe1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ukerbe1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbUcsd34( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUcsd34(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-UCSD34 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-UCSD34 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUcsd34",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-UCSD34 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-UCSD34 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def CitHepth2007( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CitHepth2007(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cit-HepTh2007 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cit-HepTh2007 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CitHepth2007",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cit-HepTh2007 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cit-HepTh2007 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}
#   def Alemdar( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Alemdar(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Alemdar graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Alemdar graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Alemdar",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Alemdar graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Alemdar graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocYoutubeSnap( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocYoutubeSnap(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-youtube-snap graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-youtube-snap graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{mislove-2007-socialnetworks,
	        author = {Alan Mislove and Massimiliano Marcon and Krishna P. Gummadi and Peter Druschel and Bobby Bhattacharjee},
	        title = {{Measurement and Analysis of Online Social Networks}},
	        booktitle = {Proceedings of the 5th ACM/Usenix Internet Measurement Conference (IMC'07)},
	        address = {San Diego, CA},
	        month = {October},
	        year = {2007}}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocYoutubeSnap",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-youtube-snap graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-youtube-snap graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{mislove-2007-socialnetworks,
        author = {Alan Mislove and Massimiliano Marcon and Krishna P. Gummadi and Peter Druschel and Bobby Bhattacharjee},
        title = {{Measurement and Analysis of Online Social Networks}},
        booktitle = {Proceedings of the 5th ACM/Usenix Internet Measurement Conference (IMC'07)},
        address = {San Diego, CA},
        month = {October},
        year = {2007}}
#   def Ragusa18( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ragusa18(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Ragusa18 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Ragusa18 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ragusa18",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Ragusa18 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Ragusa18 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioWormnetV3Benchmark( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioWormnetV3Benchmark(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-WormNet-v3-benchmark graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-WormNet-v3-benchmark graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{cho2014wormnet,
	        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
	        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
	        journal={Nucleic acids research},
	        volume={42},
	        number={W1},
	        pages={W76--W82},
	        year={2014},
	        publisher={Oxford University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioWormnetV3Benchmark",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-WormNet-v3-benchmark graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-WormNet-v3-benchmark graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{cho2014wormnet,
        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
        journal={Nucleic acids research},
        volume={42},
        number={W1},
        pages={W76--W82},
        year={2014},
        publisher={Oxford University Press}
}
#   def CondMat2003( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CondMat2003(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cond-mat-2003 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cond-mat-2003 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CondMat2003",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cond-mat-2003 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cond-mat-2003 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbWashu32( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbWashu32(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-WashU32 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-WashU32 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbWashu32",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-WashU32 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-WashU32 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def WebSk2005All( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebSk2005All(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-sk-2005-all graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-sk-2005-all graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@ARTICLE{boldi2004-ubicrawler,
	        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
	        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
	        journal = {Software: Practice \& Experience},
	        year = {2004},
	        volume = {34},
	        pages = {711--726},
	        number = {8}}
	
	@INPROCEEDINGS{Boldi-2011-layered,
	        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
	        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering	for Compressing Social Networks},
	        booktitle = {WWW},
	        year = {2011},
	        pages = {587--596}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebSk2005All",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-sk-2005-all graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-sk-2005-all graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@ARTICLE{boldi2004-ubicrawler,
        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
        journal = {Software: Practice \& Experience},
        year = {2004},
        volume = {34},
        pages = {711--726},
        number = {8}}

@INPROCEEDINGS{Boldi-2011-layered,
        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering  for Compressing Social Networks},
        booktitle = {WWW},
        year = {2011},
        pages = {587--596}
}
#   def Sw100040d2Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100040d2Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-4-0d2-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-4-0d2-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100040d2Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-4-0d2-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-4-0d2-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def C20005( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def C20005(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the C2000-5 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of C2000-5 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="C20005",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the C2000-5 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of C2000-5 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def SocFriendster( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocFriendster(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-friendster graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-friendster graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{friendster,
	        author = {Friendster social network},
	        title = {Friendster: The online gaming social network},
	        note = {{https://archive.org/details/friendster-dataset-201107}}}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocFriendster",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-friendster graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-friendster graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{friendster,
        author = {Friendster social network},
        title = {Friendster: The online gaming social network},
        note = {{https://archive.org/details/friendster-dataset-201107}}}
#   def BioCeHt( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioCeHt(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-CE-HT graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-CE-HT graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{cho2014wormnet,
	        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
	        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
	        journal={Nucleic acids research},
	        volume={42},
	        number={W1},
	        pages={W76--W82},
	        year={2014},
	        publisher={Oxford University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioCeHt",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-CE-HT graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-CE-HT graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{cho2014wormnet,
        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
        journal={Nucleic acids research},
        volume={42},
        number={W1},
        pages={W76--W82},
        year={2014},
        publisher={Oxford University Press}
}
#   def SocfbUconn91( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUconn91(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-UConn91 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-UConn91 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUconn91",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-UConn91 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-UConn91 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def G56( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G56(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G56 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G56 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G56",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G56 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G56 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Trdheim( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Trdheim(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the trdheim graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of trdheim graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Trdheim",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the trdheim graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of trdheim graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G9( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G9(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G9 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G9 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G9",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G9 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G9 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G46( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G46(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G46 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G46 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G46",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G46 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G46 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100040d1Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100040d1Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-4-0d1-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-4-0d1-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100040d1Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-4-0d1-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-4-0d1-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def NR12month1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def NR12month1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the 12month1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of 12month1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="NR12month1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the 12month1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of 12month1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Farm( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Farm(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the farm graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of farm graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Farm",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the farm graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of farm graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Usroads( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Usroads(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the usroads graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of usroads graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Usroads",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the usroads graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of usroads graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Erdos972( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Erdos972(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Erdos972 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Erdos972 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Erdos972",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Erdos972 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Erdos972 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def HepThNew( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def HepThNew(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the HEP-th-new graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of HEP-th-new graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="HepThNew",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the HEP-th-new graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of HEP-th-new graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cegb2919( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cegb2919(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cegb2919 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cegb2919 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cegb2919",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cegb2919 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cegb2919 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioDiseasome( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioDiseasome(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-diseasome graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-diseasome graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{goh2007human,
	        title={The human disease network},
	        author={Goh, Kwang-Il and Cusick, Michael E and Valle, David and Childs, Barton and Vidal, Marc and Barab{\'a}si,
	Albert-L{\'a}szl{\'o}
	},
	        journal={Proceedings of the National Academy of Sciences},
	        volume={104},
	        number={21},
	        pages={8685--8690},
	        year={2007},
	        publisher={National Acad Sciences}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioDiseasome",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-diseasome graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-diseasome graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{goh2007human,
        title={The human disease network},
        author={Goh, Kwang-Il and Cusick, Michael E and Valle, David and Childs, Barton and Vidal, Marc and Barab{'a}si,
Albert-L{'a}szl{'o}
},
        journal={Proceedings of the National Academy of Sciences},
        volume={104},
        number={21},
        pages={8685--8690},
        year={2007},
        publisher={National Acad Sciences}
}
#   def OrkutGroupmemberships( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def OrkutGroupmemberships(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the orkut-groupmemberships graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of orkut-groupmemberships graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="OrkutGroupmemberships",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the orkut-groupmemberships graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of orkut-groupmemberships graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw1000050d2Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000050d2Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-5-0d2-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-5-0d2-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000050d2Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-5-0d2-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-5-0d2-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Pkustk10( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pkustk10(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the pkustk10 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of pkustk10 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pkustk10",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the pkustk10 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of pkustk10 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Airfoil1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Airfoil1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the airfoil1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of airfoil1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Airfoil1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the airfoil1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of airfoil1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WebIt2004All( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebIt2004All(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-it-2004-all graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-it-2004-all graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@ARTICLE{boldi2004-ubicrawler,
	        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
	        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
	        journal = {Software: Practice \& Experience},
	        year = {2004},
	        volume = {34},
	        pages = {711--726},
	        number = {8}}
	
	@INPROCEEDINGS{Boldi-2011-layered,
	        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
	        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering	for Compressing Social Networks},
	        booktitle = {WWW},
	        year = {2011},
	        pages = {587--596}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebIt2004All",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-it-2004-all graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-it-2004-all graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@ARTICLE{boldi2004-ubicrawler,
        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
        journal = {Software: Practice \& Experience},
        year = {2004},
        volume = {34},
        pages = {711--726},
        number = {8}}

@INPROCEEDINGS{Boldi-2011-layered,
        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering  for Compressing Social Networks},
        booktitle = {WWW},
        year = {2011},
        pages = {587--596}
}
#   def Sw1000050d1Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000050d1Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-5-0d1-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-5-0d1-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000050d1Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-5-0d1-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-5-0d1-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cage7( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cage7(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cage7 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cage7 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cage7",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cage7 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cage7 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def TechRlCaida( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def TechRlCaida(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the tech-RL-caida graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of tech-RL-caida graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{spring2002measuring,
	        title={Measuring ISP topologies with Rocketfuel},
	        author={Spring, Neil and Mahajan, Ratul and Wetherall, David},
	        booktitle={ACM SIGCOMM Computer Communication Review},
	        volume={32},
	        number={4},
	        pages={133--145},
	        year={2002},
	        organization={ACM}
	}
	
	@inproceedings{rossi2013topology,
	        title={A Multi-Level Approach for Evaluating Internet Topology Generators},
	        author={Ryan A. Rossi and Sonia Fahmy and Nilothpal Talukder},
	        booktitle={IFIP Networking},
	        pages={1--9},
	        year={2013}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="TechRlCaida",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the tech-RL-caida graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of tech-RL-caida graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{spring2002measuring,
        title={Measuring ISP topologies with Rocketfuel},
        author={Spring, Neil and Mahajan, Ratul and Wetherall, David},
        booktitle={ACM SIGCOMM Computer Communication Review},
        volume={32},
        number={4},
        pages={133--145},
        year={2002},
        organization={ACM}
}

@inproceedings{rossi2013topology,
        title={A Multi-Level Approach for Evaluating Internet Topology Generators},
        author={Ryan A. Rossi and Sonia Fahmy and Nilothpal Talukder},
        booktitle={IFIP Networking},
        pages={1--9},
        year={2013}
}
#   def WebBerkstan( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebBerkstan(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-BerkStan graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-BerkStan graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebBerkstan",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-BerkStan graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-BerkStan graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Blckhole( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Blckhole(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the blckhole graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of blckhole graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Blckhole",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the blckhole graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of blckhole graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Bcsstm24( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcsstm24(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcsstm24 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcsstm24 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcsstm24",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcsstm24 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcsstm24 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Trec4( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Trec4(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Trec4 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Trec4 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Trec4",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Trec4 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Trec4 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cora( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cora(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cora graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cora graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cora",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cora graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cora graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Brock8003( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Brock8003(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the brock800-3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of brock800-3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Brock8003",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the brock800-3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of brock800-3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def SocfbSimmons81( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbSimmons81(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Simmons81 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Simmons81 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbSimmons81",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Simmons81 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Simmons81 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Venturilevel3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Venturilevel3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the venturiLevel3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of venturiLevel3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Venturilevel3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the venturiLevel3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of venturiLevel3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioDrCx( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioDrCx(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-DR-CX graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-DR-CX graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{cho2014wormnet,
	        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
	        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
	        journal={Nucleic acids research},
	        volume={42},
	        number={W1},
	        pages={W76--W82},
	        year={2014},
	        publisher={Oxford University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioDrCx",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-DR-CX graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-DR-CX graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{cho2014wormnet,
        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
        journal={Nucleic acids research},
        volume={42},
        number={W1},
        pages={W76--W82},
        year={2014},
        publisher={Oxford University Press}
}
#   def IpTrace( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def IpTrace(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ip-trace graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ip-trace graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="IpTrace",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ip-trace graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ip-trace graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Hugetrace00020( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Hugetrace00020(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the hugetrace-00020 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of hugetrace-00020 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Hugetrace00020",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the hugetrace-00020 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of hugetrace-00020 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbCaltech36( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbCaltech36(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Caltech36 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Caltech36 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbCaltech36",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Caltech36 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Caltech36 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Bcspwr07( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcspwr07(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcspwr07 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcspwr07 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcspwr07",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcspwr07 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcspwr07 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocTwitterHiggs( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocTwitterHiggs(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-twitter-higgs graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-twitter-higgs graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{de2013anatomy,
	        title={The anatomy of a scientific rumor},
	        author={De Domenico, Manlio and Lima, Antonio and Mougel, Paul and Musolesi, Mirco},
	        journal={Scientific reports},
	        volume={3},
	        year={2013},
	        publisher={Nature Publishing Group}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocTwitterHiggs",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-twitter-higgs graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-twitter-higgs graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{de2013anatomy,
        title={The anatomy of a scientific rumor},
        author={De Domenico, Manlio and Lima, Antonio and Mougel, Paul and Musolesi, Mirco},
        journal={Scientific reports},
        volume={3},
        year={2013},
        publisher={Nature Publishing Group}
}
#   def Sw100030d3Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100030d3Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-3-0d3-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-3-0d3-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100030d3Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-3-0d3-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-3-0d3-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbBAnon( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbBAnon(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-B-anon graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-B-anon graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbBAnon",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-B-anon graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-B-anon graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def G24( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G24(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G24 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G24 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G24",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G24 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G24 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CfinderGoogle( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CfinderGoogle(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cfinder-google graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cfinder-google graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CfinderGoogle",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cfinder-google graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cfinder-google graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbWesleyan43( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbWesleyan43(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Wesleyan43 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Wesleyan43 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbWesleyan43",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Wesleyan43 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Wesleyan43 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def San200092( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def San200092(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the san200-0-9-2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of san200-0-9-2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="San200092",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the san200-0-9-2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of san200-0-9-2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def RoadRoadnetCa( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def RoadRoadnetCa(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the road-roadNet-CA graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of road-roadNet-CA graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="RoadRoadnetCa",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the road-roadNet-CA graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of road-roadNet-CA graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioMouseGene( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioMouseGene(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-mouse-gene graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-mouse-gene graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{bansal2007infer,
	        title={How to infer gene networks from expression profiles},
	        author={Bansal, Mukesh and Belcastro, Vincenzo and Ambesi-Impiombato, Alberto and Di Bernardo, Diego},
	        journal={Molecular systems biology},
	        volume={3},
	        number={1},
	        year={2007},
	        publisher={Wiley Online Library}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioMouseGene",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-mouse-gene graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-mouse-gene graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{bansal2007infer,
        title={How to infer gene networks from expression profiles},
        author={Bansal, Mukesh and Belcastro, Vincenzo and Ambesi-Impiombato, Alberto and Di Bernardo, Diego},
        journal={Molecular systems biology},
        volume={3},
        number={1},
        year={2007},
        publisher={Wiley Online Library}
}
#   def Sw10030d1Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10030d1Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-3-0d1-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-3-0d1-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10030d1Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-3-0d1-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-3-0d1-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ig514( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ig514(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the IG5-14 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of IG5-14 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ig514",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the IG5-14 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of IG5-14 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Tf16( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Tf16(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the TF16 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of TF16 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Tf16",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the TF16 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of TF16 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Fullb( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Fullb(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the fullb graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of fullb graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Fullb",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the fullb graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of fullb graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw10030d2Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10030d2Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-3-0d2-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-3-0d2-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10030d2Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-3-0d2-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-3-0d2-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CopresenceInvs13( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CopresenceInvs13(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the copresence-InVS13 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of copresence-InVS13 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{infect,
	        author={{SocioPatterns}},
	        title={Infectious contact networks},
	        url={http://www.sociopatterns.org/datasets/}}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CopresenceInvs13",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the copresence-InVS13 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of copresence-InVS13 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{infect,
        author={{SocioPatterns}},
        title={Infectious contact networks},
        url={http://www.sociopatterns.org/datasets/}}
#   def Cl100002d1Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl100002d1Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-10000-2d1-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-10000-2d1-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl100002d1Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-10000-2d1-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-10000-2d1-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbBrandeis99( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbBrandeis99(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Brandeis99 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Brandeis99 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbBrandeis99",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Brandeis99 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Brandeis99 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def BioDmLc( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioDmLc(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-DM-LC graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-DM-LC graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{cho2014wormnet,
	        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
	        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
	        journal={Nucleic acids research},
	        volume={42},
	        number={W1},
	        pages={W76--W82},
	        year={2014},
	        publisher={Oxford University Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioDmLc",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-DM-LC graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-DM-LC graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{cho2014wormnet,
        title={WormNet v3: a network-assisted hypothesis-generating server for Caenorhabditis elegans},
        author={Cho, Ara and Shin, Junha and Hwang, Sohyun and Kim, Chanyoung and Shim, Hongseok and Kim, Hyojin and Kim, Hanhae and Lee, Insuk},
        journal={Nucleic acids research},
        volume={42},
        number={W1},
        pages={W76--W82},
        year={2014},
        publisher={Oxford University Press}
}
#   def Sls( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sls(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the sls graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of sls graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sls",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the sls graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of sls graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Johnson1624( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Johnson1624(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the johnson16-2-4 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of johnson16-2-4 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Johnson1624",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the johnson16-2-4 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of johnson16-2-4 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def CiteulikeUt( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CiteulikeUt(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the citeulike-ut graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of citeulike-ut graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CiteulikeUt",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the citeulike-ut graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of citeulike-ut graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10000001d7Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10000001d7Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000000-1d7-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000000-1d7-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10000001d7Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000000-1d7-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000000-1d7-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Amazon2008( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Amazon2008(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the amazon-2008 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of amazon-2008 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Amazon2008",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the amazon-2008 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of amazon-2008 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbTexas84( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbTexas84(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Texas84 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Texas84 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbTexas84",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Texas84 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Texas84 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def DbpediaWriter( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def DbpediaWriter(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the dbpedia-writer graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of dbpedia-writer graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="DbpediaWriter",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the dbpedia-writer graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of dbpedia-writer graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def NR3dtube( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def NR3dtube(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the 3dtube graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of 3dtube graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="NR3dtube",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the 3dtube graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of 3dtube graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Rw136( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Rw136(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the rw136 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of rw136 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Rw136",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the rw136 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of rw136 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10001d8Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10001d8Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000-1d8-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000-1d8-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10001d8Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000-1d8-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000-1d8-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cage( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cage(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cage graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cage graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cage",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cage graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cage graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def HospitalWardProximity( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def HospitalWardProximity(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the hospital-ward-proximity graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of hospital-ward-proximity graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{infect,
	        author={{SocioPatterns}},
	        title={Infectious contact networks},
	        url={http://www.sociopatterns.org/datasets/}}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="HospitalWardProximity",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the hospital-ward-proximity graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of hospital-ward-proximity graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{infect,
        author={{SocioPatterns}},
        title={Infectious contact networks},
        url={http://www.sociopatterns.org/datasets/}}
#   def SocfbDartmouth6( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbDartmouth6(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Dartmouth6 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Dartmouth6 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbDartmouth6",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Dartmouth6 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Dartmouth6 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Ford2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ford2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ford2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ford2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ford2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ford2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ford2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def TechAs735( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def TechAs735(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the tech-as-735 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of tech-as-735 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="TechAs735",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the tech-as-735 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of tech-as-735 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def MaayanPdzbase( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def MaayanPdzbase(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the maayan-pdzbase graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of maayan-pdzbase graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="MaayanPdzbase",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the maayan-pdzbase graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of maayan-pdzbase graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def MaayanFoodweb( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def MaayanFoodweb(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the maayan-foodweb graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of maayan-foodweb graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="MaayanFoodweb",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the maayan-foodweb graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of maayan-foodweb graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw1000060d3Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000060d3Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-6-0d3-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-6-0d3-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000060d3Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-6-0d3-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-6-0d3-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbUc33( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUc33(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-UC33 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-UC33 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUc33",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-UC33 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-UC33 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Sw10040d3Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10040d3Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-4-0d3-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-4-0d3-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10040d3Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-4-0d3-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-4-0d3-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def MiscLesmis( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def MiscLesmis(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the misc-lesmis graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of misc-lesmis graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{newman2004finding,
	        title={Finding and evaluating community structure in networks},
	        author={Newman, Mark EJ and Girvan, Michelle},
	        journal={Physical review E},
	        volume={69},
	        number={2},
	        pages={026113},
	        year={2004},
	        publisher={APS}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="MiscLesmis",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the misc-lesmis graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of misc-lesmis graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{newman2004finding,
        title={Finding and evaluating community structure in networks},
        author={Newman, Mark EJ and Girvan, Michelle},
        journal={Physical review E},
        volume={69},
        number={2},
        pages={026113},
        year={2004},
        publisher={APS}
}
#   def BioCelegansneural( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioCelegansneural(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-celegansneural graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-celegansneural graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{duch2005community,
	        title={Community identification using Extremal Optimization Phys},
	        author={Duch, J. and Arenas, A.},
	        journal={Rev. E},
	        volume={72},
	        pages={027104},
	        year={2005}
	}
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioCelegansneural",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-celegansneural graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-celegansneural graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{duch2005community,
        title={Community identification using Extremal Optimization Phys},
        author={Duch, J. and Arenas, A.},
        journal={Rev. E},
        volume={72},
        pages={027104},
        year={2005}
}

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}
#   def Orkut( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Orkut(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the orkut graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of orkut graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Orkut",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the orkut graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of orkut graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Pkustk11( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pkustk11(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the pkustk11 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of pkustk11 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pkustk11",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the pkustk11 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of pkustk11 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw1000050d2Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000050d2Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-5-0d2-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-5-0d2-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000050d2Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-5-0d2-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-5-0d2-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Pkustk01( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pkustk01(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the pkustk01 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of pkustk01 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pkustk01",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the pkustk01 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of pkustk01 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cti( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cti(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cti graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cti graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cti",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cti graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cti graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cage6( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cage6(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cage6 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cage6 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cage6",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cage6 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cage6 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocTwitter2010( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocTwitter2010(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-twitter-2010 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-twitter-2010 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{BoVWFI,
	        author ={Paolo Boldi and Sebastiano Vigna},
	        title = {The {W}eb{G}raph Framework {I}: {C}ompression Techniques},
	        year = {2004},
	        booktitle= {Proc. of the Thirteenth International World Wide Web Conference (WWW 2004)},
	        address={Manhattan, USA},
	        pages={595--601},
	        publisher={ACM Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocTwitter2010",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-twitter-2010 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-twitter-2010 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{BoVWFI,
        author ={Paolo Boldi and Sebastiano Vigna},
        title = {The {W}eb{G}raph Framework {I}: {C}ompression Techniques},
        year = {2004},
        booktitle= {Proc. of the Thirteenth International World Wide Web Conference (WWW 2004)},
        address={Manhattan, USA},
        pages={595--601},
        publisher={ACM Press}
}
#   def Sw1000050d1Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000050d1Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-5-0d1-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-5-0d1-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000050d1Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-5-0d1-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-5-0d1-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def TechRoutersRf( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def TechRoutersRf(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the tech-routers-rf graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of tech-routers-rf graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{rocketfuel,
	        title={Measuring {ISP} topologies with Rocketfuel},
	        author={Spring, N. and Mahajan, R. and Wetherall, D.},
	        booktitle={SIGCOMM},
	        volume={32},
	        number={4},
	        pages={133--145},
	        year={2002}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="TechRoutersRf",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the tech-routers-rf graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of tech-routers-rf graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{rocketfuel,
        title={Measuring {ISP} topologies with Rocketfuel},
        author={Spring, N. and Mahajan, R. and Wetherall, D.},
        booktitle={SIGCOMM},
        volume={32},
        number={4},
        pages={133--145},
        year={2002}
}
#   def ScPwtk( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def ScPwtk(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the sc-pwtk graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of sc-pwtk graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="ScPwtk",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the sc-pwtk graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of sc-pwtk graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}
#   def PHat7001( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def PHat7001(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the p-hat700-1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of p-hat700-1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="PHat7001",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the p-hat700-1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of p-hat700-1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Power( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Power(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the power graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of power graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Power",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the power graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of power graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Citeseer( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Citeseer(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the citeseer graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of citeseer graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Citeseer",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the citeseer graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of citeseer graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100040d2Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100040d2Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-4-0d2-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-4-0d2-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100040d2Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-4-0d2-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-4-0d2-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl100001d9Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl100001d9Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-10000-1d9-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-10000-1d9-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl100001d9Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-10000-1d9-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-10000-1d9-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G47( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G47(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G47 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G47 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G47",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G47 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G47 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def AvesWildbirdNetwork( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def AvesWildbirdNetwork(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the aves-wildbird-network graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of aves-wildbird-network graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="AvesWildbirdNetwork",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the aves-wildbird-network graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of aves-wildbird-network graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100040d1Trial2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100040d1Trial2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-4-0d1-trial2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-4-0d1-trial2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100040d1Trial2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-4-0d1-trial2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-4-0d1-trial2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G8( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G8(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G8 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G8 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G8",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G8 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G8 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G25( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G25(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G25 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G25 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G25",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G25 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G25 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100030d3Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100030d3Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-3-0d3-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-3-0d3-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100030d3Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-3-0d3-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-3-0d3-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WikisignedK2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WikisignedK2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the wikisigned-k2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of wikisigned-k2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WikisignedK2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the wikisigned-k2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of wikisigned-k2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocLjournal2008( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocLjournal2008(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-ljournal-2008 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-ljournal-2008 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocLjournal2008",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-ljournal-2008 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-ljournal-2008 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def G35( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G35(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G35 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G35 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G35",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G35 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G35 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Bcspwr06( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcspwr06(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcspwr06 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcspwr06 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcspwr06",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcspwr06 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcspwr06 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CopresenceSfhh( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CopresenceSfhh(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the copresence-SFHH graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of copresence-SFHH graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{infect,
	        author={{SocioPatterns}},
	        title={Infectious contact networks},
	        url={http://www.sociopatterns.org/datasets/}}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CopresenceSfhh",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the copresence-SFHH graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of copresence-SFHH graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{infect,
        author={{SocioPatterns}},
        title={Infectious contact networks},
        url={http://www.sociopatterns.org/datasets/}}
#   def Auto( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Auto(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the auto graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of auto graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Auto",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the auto graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of auto graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def San200093( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def San200093(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the san200-0-9-3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of san200-0-9-3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="San200093",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the san200-0-9-3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of san200-0-9-3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Hugetric00020( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Hugetric00020(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the hugetric-00020 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of hugetric-00020 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Hugetric00020",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the hugetric-00020 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of hugetric-00020 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Trec5( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Trec5(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Trec5 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Trec5 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Trec5",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Trec5 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Trec5 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbVanderbilt48( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbVanderbilt48(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Vanderbilt48 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Vanderbilt48 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbVanderbilt48",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Vanderbilt48 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Vanderbilt48 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Bcsstm25( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Bcsstm25(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bcsstm25 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bcsstm25 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Bcsstm25",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bcsstm25 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bcsstm25 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def NR162bit( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def NR162bit(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the 162bit graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of 162bit graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="NR162bit",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the 162bit graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of 162bit graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbEmory27( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbEmory27(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Emory27 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Emory27 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbEmory27",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Emory27 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Emory27 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def SocfbUcf52( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUcf52(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-UCF52 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-UCF52 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUcf52",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-UCF52 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-UCF52 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def SocfbCal65( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbCal65(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Cal65 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Cal65 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbCal65",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Cal65 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Cal65 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Odepb400( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Odepb400(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the odepb400 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of odepb400 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Odepb400",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the odepb400 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of odepb400 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def TechArenasPgp( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def TechArenasPgp(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the tech-arenas-pgp graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of tech-arenas-pgp graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="TechArenasPgp",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the tech-arenas-pgp graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of tech-arenas-pgp graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioCelegansDir( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioCelegansDir(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-celegans-dir graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-celegans-dir graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{duch2005community,
	        title={Community identification using Extremal Optimization Phys},
	        author={Duch, J. and Arenas, A.},
	        journal={Rev. E},
	        volume={72},
	        pages={027104},
	        year={2005}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioCelegansDir",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-celegans-dir graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-celegans-dir graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{duch2005community,
        title={Community identification using Extremal Optimization Phys},
        author={Duch, J. and Arenas, A.},
        journal={Rev. E},
        volume={72},
        pages={027104},
        year={2005}
}
#   def Cl10002d0Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10002d0Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000-2d0-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000-2d0-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10002d0Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000-2d0-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000-2d0-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Brock8002( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Brock8002(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the brock800-2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of brock800-2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Brock8002",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the brock800-2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of brock800-2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Cegb2802( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cegb2802(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cegb2802 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cegb2802 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cegb2802",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cegb2802 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cegb2802 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocFlixster( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocFlixster(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-flixster graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-flixster graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{zafarani2014users,
	        title={Users Joining Multiple Sites: Distributions and Patterns},
	        author={Zafarani, Reza and Liu, Huan},
	        booktitle = {Proceedings of the 8th International AAAI Conference on Weblogs and Social Media (ICWSM'14)},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocFlixster",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-flixster graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-flixster graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{zafarani2014users,
        title={Users Joining Multiple Sites: Distributions and Patterns},
        author={Zafarani, Reza and Liu, Huan},
        booktitle = {Proceedings of the 8th International AAAI Conference on Weblogs and Social Media (ICWSM'14)},
        year={2014}
}
#   def SocfbRice31( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbRice31(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Rice31 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Rice31 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbRice31",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Rice31 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Rice31 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Ash85( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ash85(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ash85 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ash85 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ash85",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ash85 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ash85 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbPenn94( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbPenn94(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Penn94 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Penn94 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbPenn94",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Penn94 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Penn94 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Cage11( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cage11(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the cage11 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of cage11 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cage11",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the cage11 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of cage11 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Fa( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Fa(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the FA graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of FA graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Fa",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the FA graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of FA graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw10060d2Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw10060d2Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-100-6-0d2-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-100-6-0d2-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw10060d2Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-100-6-0d2-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-100-6-0d2-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw1000040d2Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000040d2Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-4-0d2-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-4-0d2-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000040d2Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-4-0d2-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-4-0d2-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def GottronExcellent( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def GottronExcellent(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the gottron-excellent graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of gottron-excellent graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="GottronExcellent",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the gottron-excellent graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of gottron-excellent graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100050d1Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100050d1Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-5-0d1-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-5-0d1-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100050d1Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-5-0d1-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-5-0d1-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocWikiVote( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocWikiVote(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-wiki-Vote graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-wiki-Vote graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{leskovec2010signed,
	        title={Signed networks in social media},
	        author={Leskovec, Jure and Huttenlocher, Daniel and Kleinberg, Jon},
	        booktitle={Proceedings of the SIGCHI Conference on Human Factors in Computing Systems},
	        pages={1361--1370},
	        year={2010},
	        organization={ACM}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocWikiVote",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-wiki-Vote graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-wiki-Vote graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{leskovec2010signed,
        title={Signed networks in social media},
        author={Leskovec, Jure and Huttenlocher, Daniel and Kleinberg, Jon},
        booktitle={Proceedings of the SIGCHI Conference on Human Factors in Computing Systems},
        pages={1361--1370},
        year={2010},
        organization={ACM}
}
#   def VisualizeUs( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def VisualizeUs(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the visualize-us graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of visualize-us graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="VisualizeUs",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the visualize-us graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of visualize-us graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Pgpgiantcompo( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pgpgiantcompo(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the PGPgiantcompo graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of PGPgiantcompo graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pgpgiantcompo",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the PGPgiantcompo graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of PGPgiantcompo graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocBrightkite( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocBrightkite(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-brightkite graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-brightkite graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{cho2011friendship,
	        title={Friendship and mobility: user movement in location-based social networks},
	        author={Cho, Eunjoon and Myers, Seth A and Leskovec, Jure},
	        booktitle={Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining},
	        pages={1082--1090},
	        year={2011},
	        organization={ACM}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocBrightkite",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-brightkite graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-brightkite graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{cho2011friendship,
        title={Friendship and mobility: user movement in location-based social networks},
        author={Cho, Eunjoon and Myers, Seth A and Leskovec, Jure},
        booktitle={Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining},
        pages={1082--1090},
        year={2011},
        organization={ACM}
}
#   def EcoMangwet( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def EcoMangwet(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the eco-mangwet graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of eco-mangwet graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{ulanowicz1998network,
	        title={Network analysis of trophic dynamics in south florida ecosystems},
	        author={Ulanowicz, Robert E and DeAngelis, Donald L},
	        journal={FY97: The Florida Bay Ecosystem},
	        pages={20688--20038},
	        year={1998}
	}
	
	@article{melian2004food,
	        title={Food web cohesion},
	        author={Meli{\'a}n,
	Carlos J and Bascompte, Jordi},
	        journal={Ecology},
	        volume={85},
	        number={2},
	        pages={352--358},
	        year={2004},
	        publisher={Eco Soc America}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="EcoMangwet",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the eco-mangwet graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of eco-mangwet graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{ulanowicz1998network,
        title={Network analysis of trophic dynamics in south florida ecosystems},
        author={Ulanowicz, Robert E and DeAngelis, Donald L},
        journal={FY97: The Florida Bay Ecosystem},
        pages={20688--20038},
        year={1998}
}

@article{melian2004food,
        title={Food web cohesion},
        author={Meli{'a}n,
Carlos J and Bascompte, Jordi},
        journal={Ecology},
        volume={85},
        number={2},
        pages={352--358},
        year={2004},
        publisher={Eco Soc America}
}
#   def SocKarate( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocKarate(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-karate graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-karate graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{zachary1977information,
	        title={An information flow model for conflict and fission in small groups},
	        author={Zachary, Wayne W},
	        journal={Journal of anthropological research},
	        pages={452--473},
	        year={1977},
	        publisher={JSTOR}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocKarate",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-karate graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-karate graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{zachary1977information,
        title={An information flow model for conflict and fission in small groups},
        author={Zachary, Wayne W},
        journal={Journal of anthropological research},
        pages={452--473},
        year={1977},
        publisher={JSTOR}
}
#   def M3plates( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def M3plates(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the m3plates graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of m3plates graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="M3plates",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the m3plates graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of m3plates graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Brock4004( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Brock4004(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the brock400-4 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of brock400-4 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Brock4004",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the brock400-4 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of brock400-4 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def SocLivejournalUserGroups( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocLivejournalUserGroups(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-livejournal-user-groups graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-livejournal-user-groups graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocLivejournalUserGroups",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-livejournal-user-groups graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-livejournal-user-groups graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocStudentCoop( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocStudentCoop(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-student-coop graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-student-coop graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{Fire2012,
	        title={Predicting Student Exam's Scores by Analyzing Social Network Data},
	        author={Michael Fire, Gilad Katz, Yuval Elovici, Bracha Shapira, and Lior Rokach},
	        booktitle={Active Media Technology},
	        pages={584--595},
	        year={2012},
	        publisher={Springer}	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocStudentCoop",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-student-coop graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-student-coop graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{Fire2012,
        title={Predicting Student Exam's Scores by Analyzing Social Network Data},
        author={Michael Fire, Gilad Katz, Yuval Elovici, Bracha Shapira, and Lior Rokach},
        booktitle={Active Media Technology},
        pages={584--595},
        year={2012},
        publisher={Springer}    }
#   def G61( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G61(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G61 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G61 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G61",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G61 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G61 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WbEdu( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WbEdu(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the wb-edu graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of wb-edu graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WbEdu",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the wb-edu graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of wb-edu graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl1000002d0Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl1000002d0Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-100000-2d0-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-100000-2d0-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl1000002d0Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-100000-2d0-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-100000-2d0-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def PetsterHamster( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def PetsterHamster(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the petster-hamster graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of petster-hamster graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="PetsterHamster",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the petster-hamster graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of petster-hamster graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def ScRel9( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def ScRel9(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the sc-rel9 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of sc-rel9 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="ScRel9",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the sc-rel9 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of sc-rel9 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}
#   def PHat5002( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def PHat5002(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the p-hat500-2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of p-hat500-2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="PHat5002",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the p-hat500-2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of p-hat500-2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def Stufe( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Stufe(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the stufe graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of stufe graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Stufe",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the stufe graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of stufe graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10000001d9Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10000001d9Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000000-1d9-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000000-1d9-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10000001d9Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000000-1d9-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000000-1d9-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Polbooks( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Polbooks(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the polbooks graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of polbooks graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Polbooks",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the polbooks graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of polbooks graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Ramage02( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Ramage02(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ramage02 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ramage02 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Ramage02",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ramage02 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ramage02 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocFlickrAsu( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocFlickrAsu(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-Flickr-ASU graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-Flickr-ASU graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocFlickrAsu",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-Flickr-ASU graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-Flickr-ASU graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw1000030d3Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000030d3Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-3-0d3-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-3-0d3-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000030d3Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-3-0d3-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-3-0d3-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CaHollywood2009( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CaHollywood2009(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ca-hollywood-2009 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ca-hollywood-2009 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{BoVWFI,
	        author ={Paolo Boldi and Sebastiano Vigna},
	        title = {The {W}eb{G}raph Framework {I}: {C}ompression Techniques},
	        year = {2004},
	        booktitle= {Proc. of the Thirteenth International World Wide Web Conference (WWW 2004)},
	        address={Manhattan, USA},
	        pages={595--601},
	        publisher={ACM Press}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CaHollywood2009",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ca-hollywood-2009 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ca-hollywood-2009 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{BoVWFI,
        author ={Paolo Boldi and Sebastiano Vigna},
        title = {The {W}eb{G}raph Framework {I}: {C}ompression Techniques},
        year = {2004},
        booktitle= {Proc. of the Thirteenth International World Wide Web Conference (WWW 2004)},
        address={Manhattan, USA},
        pages={595--601},
        publisher={ACM Press}
}
#   def WebNotredame( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebNotredame(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-NotreDame graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-NotreDame graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebNotredame",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-NotreDame graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-NotreDame graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CaMathscinet( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CaMathscinet(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ca-MathSciNet graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ca-MathSciNet graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{palla2008fundamental,
	        title={Fundamental statistical features and self-similar properties of tagged networks},
	        author={Palla, Gergely and Farkas, Ill{\'e}s J and Pollner,
	P{\'e}ter and Der{\'e}nyi,
	Imre and Vicsek, Tam{\'a}s},
	        journal={New Journal of Physics},
	        volume={10},
	        number={12},
	        pages={123026},
	        year={2008},
	        publisher={IOP Publishing}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CaMathscinet",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ca-MathSciNet graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ca-MathSciNet graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{palla2008fundamental,
        title={Fundamental statistical features and self-similar properties of tagged networks},
        author={Palla, Gergely and Farkas, Ill{'e}s J and Pollner,
P{'e}ter and Der{'e}nyi,
Imre and Vicsek, Tam{'a}s},
        journal={New Journal of Physics},
        volume={10},
        number={12},
        pages={123026},
        year={2008},
        publisher={IOP Publishing}
}
#   def IMDB( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'labeled', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def IMDB(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "labeled",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the IMDB graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "labeled"
        The version of the graph to retrieve.		
	The available versions are:
			- dynamic
			- labeled
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of IMDB graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="IMDB",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the IMDB graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "labeled"): The version of the graph to retrieve.
    The available versions are: - dynamic - labeled
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of IMDB graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Air03( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Air03(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the air03 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of air03 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Air03",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the air03 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of air03 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WebWebbase2001( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebWebbase2001(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-webbase-2001 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-webbase-2001 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@ARTICLE{boldi2004-ubicrawler,
	        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano	Vigna},
	        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
	        journal = {Software: Practice \& Experience},
	        year = {2004},
	        volume = {34},
	        pages = {711--726},
	        number = {8}}
	
	@INPROCEEDINGS{Boldi-2011-layered,
	        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
	        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering	for Compressing Social Networks},
	        booktitle = {WWW},
	        year = {2011},
	        pages = {587--596}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebWebbase2001",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-webbase-2001 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-webbase-2001 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@ARTICLE{boldi2004-ubicrawler,
        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano    Vigna},
        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
        journal = {Software: Practice \& Experience},
        year = {2004},
        volume = {34},
        pages = {711--726},
        number = {8}}

@INPROCEEDINGS{Boldi-2011-layered,
        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering  for Compressing Social Networks},
        booktitle = {WWW},
        year = {2011},
        pages = {587--596}
}
#   def BNMacaqueRhesusBrain( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BNMacaqueRhesusBrain(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bn-macaque-rhesus_brain_1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bn-macaque-rhesus_brain_1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article {bigbrain,
	     author = {Amunts, Katrin and Lepage, Claude and Borgeat, Louis and Mohlberg, Hartmut and Dickscheid, Timo and Rousseau, Marc-{'E}tienne and Bludau,
	Sebastian and Bazin, Pierre-Louis and Lewis, Lindsay B. and Oros-Peusquens, Ana-Maria and Shah, Nadim J. and Lippert, Thomas and Zilles, Karl and Evans, Alan C.},
	     title = {BigBrain: An Ultrahigh-Resolution 3D Human Brain Model},
	     volume = {340},
	     number = {6139},
	     pages = {1472--1475},
	     year = {2013},
	     publisher = {AAAS},
	     journal = {Science}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BNMacaqueRhesusBrain",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bn-macaque-rhesus_brain_1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bn-macaque-rhesus_brain_1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article {bigbrain,
     author = {Amunts, Katrin and Lepage, Claude and Borgeat, Louis and Mohlberg, Hartmut and Dickscheid, Timo and Rousseau, Marc-{'E}tienne and Bludau,
Sebastian and Bazin, Pierre-Louis and Lewis, Lindsay B. and Oros-Peusquens, Ana-Maria and Shah, Nadim J. and Lippert, Thomas and Zilles, Karl and Evans, Alan C.},
     title = {BigBrain: An Ultrahigh-Resolution 3D Human Brain Model},
     volume = {340},
     number = {6139},
     pages = {1472--1475},
     year = {2013},
     publisher = {AAAS},
     journal = {Science}
}
#   def LasagneSpanishbook( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def LasagneSpanishbook(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the lasagne-spanishbook graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of lasagne-spanishbook graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="LasagneSpanishbook",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the lasagne-spanishbook graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of lasagne-spanishbook graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Keller4( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Keller4(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the keller4 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of keller4 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Keller4",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the keller4 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of keller4 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def ProteinsAll( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def ProteinsAll(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the proteins-all graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of proteins-all graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="ProteinsAll",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the proteins-all graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of proteins-all graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def CFat5005( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def CFat5005(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the c-fat500-5 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of c-fat500-5 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="CFat5005",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the c-fat500-5 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of c-fat500-5 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def ScMsdoor( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def ScMsdoor(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the sc-msdoor graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of sc-msdoor graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="ScMsdoor",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the sc-msdoor graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of sc-msdoor graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}
#   def TechWhois( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def TechWhois(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the tech-WHOIS graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of tech-WHOIS graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{mahadevan2006internet,
	        title={The Internet AS-level topology: three data sources and one definitive metric},
	        author={Mahadevan, P. and Krioukov, D. and Fomenkov, M. and Dimitropoulos, X. and Vahdat, A. and others},
	        journal={SIGCOMM},
	        volume={36},
	        number={1},
	        pages={17--26},
	        year={2006},
	}
	
	@misc{whois,
	    author={{WHOIS}},
	    title={{Internet} Routing Registries},
	    note={{http://www.irr.net/}}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="TechWhois",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the tech-WHOIS graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of tech-WHOIS graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{mahadevan2006internet,
        title={The Internet AS-level topology: three data sources and one definitive metric},
        author={Mahadevan, P. and Krioukov, D. and Fomenkov, M. and Dimitropoulos, X. and Vahdat, A. and others},
        journal={SIGCOMM},
        volume={36},
        number={1},
        pages={17--26},
        year={2006},
}

@misc{whois,
    author={{WHOIS}},
    title={{Internet} Routing Registries},
    note={{http://www.irr.net/}}
}
#   def Lop163( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Lop163(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the lop163 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of lop163 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Lop163",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the lop163 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of lop163 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Net75( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Net75(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the net75 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of net75 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Net75",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the net75 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of net75 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Adjnoun( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Adjnoun(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the adjnoun graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of adjnoun graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Adjnoun",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the adjnoun graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of adjnoun graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def P2pGnutella25( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def P2pGnutella25(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the p2p-Gnutella25 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of p2p-Gnutella25 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="P2pGnutella25",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the p2p-Gnutella25 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of p2p-Gnutella25 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbVillanova62( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbVillanova62(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Villanova62 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Villanova62 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbVillanova62",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Villanova62 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Villanova62 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Sw1000060d3L5( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw1000060d3L5(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-10000-6-0d3-L5 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-10000-6-0d3-L5 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw1000060d3L5",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-10000-6-0d3-L5 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-10000-6-0d3-L5 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def AstroPh( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def AstroPh(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the astro-ph graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of astro-ph graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="AstroPh",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the astro-ph graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of astro-ph graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Jagmesh2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Jagmesh2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the jagmesh2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of jagmesh2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Jagmesh2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the jagmesh2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of jagmesh2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Aa6( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Aa6(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the aa6 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of aa6 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Aa6",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the aa6 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of aa6 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Celegansneural( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Celegansneural(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the celegansneural graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of celegansneural graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Celegansneural",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the celegansneural graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of celegansneural graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Hamming82( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Hamming82(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the hamming8-2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of hamming8-2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Hamming82",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the hamming8-2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of hamming8-2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def PowerEris1176( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def PowerEris1176(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the power-eris1176 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of power-eris1176 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="PowerEris1176",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the power-eris1176 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of power-eris1176 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WebClueweb0950m( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebClueweb0950m(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-ClueWeb09-50m graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-ClueWeb09-50m graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@techreport{clarke2009overview,
	        title={Overview of the trec 2009 web track},
	        author={Clarke, Charles L and Craswell, Nick and Soboroff, Ian},
	        year={2009},
	        institution={DTIC Document}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebClueweb0950m",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-ClueWeb09-50m graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-ClueWeb09-50m graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@techreport{clarke2009overview,
        title={Overview of the trec 2009 web track},
        author={Clarke, Charles L and Craswell, Nick and Soboroff, Ian},
        year={2009},
        institution={DTIC Document}
}
#   def Pkustk08( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Pkustk08(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the pkustk08 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of pkustk08 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Pkustk08",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the pkustk08 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of pkustk08 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sw100060d3Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sw100060d3Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the SW-1000-6-0d3-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of SW-1000-6-0d3-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sw100060d3Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the SW-1000-6-0d3-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of SW-1000-6-0d3-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Oregon2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Oregon2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the Oregon-2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of Oregon-2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Oregon2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the Oregon-2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of Oregon-2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocFlickr( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocFlickr(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-flickr graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-flickr graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc {soc-flickr-photo,
	        title = {Graph of Flickr Photo-Sharing Social Network Crawled in May 2006},
	        month = {Feb},
	        year = {2012},
	        author = {David Gleich}
	}
	
	@inproceedings{rossi2014pmc-www,
	        title={Fast Maximum Clique Algorithms for Large Graphs},
	        author={Ryan A. Rossi and David F. Gleich and Assefaw H. Gebremedhin and     Mostofa A. Patwary},
	        booktitle={Proceedings of the 23rd International Conference on World     Wide Web (WWW)},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocFlickr",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-flickr graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-flickr graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc {soc-flickr-photo,
        title = {Graph of Flickr Photo-Sharing Social Network Crawled in May 2006},
        month = {Feb},
        year = {2012},
        author = {David Gleich}
}

@inproceedings{rossi2014pmc-www,
        title={Fast Maximum Clique Algorithms for Large Graphs},
        author={Ryan A. Rossi and David F. Gleich and Assefaw H. Gebremedhin and     Mostofa A. Patwary},
        booktitle={Proceedings of the 23rd International Conference on World     Wide Web (WWW)},
        year={2014}
}
#   def EgoTwitter( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def EgoTwitter(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the ego-twitter graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of ego-twitter graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="EgoTwitter",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the ego-twitter graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of ego-twitter graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Fcondp2( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Fcondp2(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the fcondp2 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of fcondp2 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Fcondp2",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the fcondp2 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of fcondp2 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def BioGridMouse( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def BioGridMouse(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the bio-grid-mouse graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of bio-grid-mouse graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="BioGridMouse",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the bio-grid-mouse graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of bio-grid-mouse graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl10000002d1Trial1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl10000002d1Trial1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-1000000-2d1-trial1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-1000000-2d1-trial1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl10000002d1Trial1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-1000000-2d1-trial1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-1000000-2d1-trial1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Kl02( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Kl02(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the kl02 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of kl02 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Kl02",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the kl02 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of kl02 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbUillinois( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUillinois(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-UIllinois graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-UIllinois graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUillinois",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-UIllinois graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-UIllinois graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def SocfbUcla26( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbUcla26(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-UCLA26 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-UCLA26 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbUcla26",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-UCLA26 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-UCLA26 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def SocfbJmu79( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbJmu79(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-JMU79 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-JMU79 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbJmu79",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-JMU79 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-JMU79 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Df2177( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Df2177(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the df2177 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of df2177 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Df2177",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the df2177 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of df2177 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def WebUk2002All( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def WebUk2002All(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the web-uk-2002-all graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of web-uk-2002-all graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@ARTICLE{boldi2004-ubicrawler,
	        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
	        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
	        journal = {Software: Practice \& Experience},
	        year = {2004},
	        volume = {34},
	        pages = {711--726},
	        number = {8}}
	
	@INPROCEEDINGS{Boldi-2011-layered,
	        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
	        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering	for Compressing Social Networks},
	        booktitle = {WWW},
	        year = {2011},
	        pages = {587--596}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="WebUk2002All",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the web-uk-2002-all graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of web-uk-2002-all graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@ARTICLE{boldi2004-ubicrawler,
        author = {Paolo Boldi and Bruno Codenotti and Massimo Santini and Sebastiano Vigna},
        title = {{UbiCrawler}: A Scalable Fully Distributed Web Crawler},
        journal = {Software: Practice \& Experience},
        year = {2004},
        volume = {34},
        pages = {711--726},
        number = {8}}

@INPROCEEDINGS{Boldi-2011-layered,
        author = {Paolo Boldi and Marco Rosa and Massimo Santini and Sebastiano Vigna},
        title = {Layered Label Propagation: A MultiResolution Coordinate-Free Ordering  for Compressing Social Networks},
        booktitle = {WWW},
        year = {2011},
        pages = {587--596}
}
#   def Uk( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Uk(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the uk graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of uk graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Uk",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the uk graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of uk graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl1000001d8Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl1000001d8Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-100000-1d8-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-100000-1d8-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl1000001d8Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-100000-1d8-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-100000-1d8-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def SocfbAmherst41( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbAmherst41(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Amherst41 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Amherst41 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbAmherst41",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Amherst41 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Amherst41 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def SocFlickrUnd( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocFlickrUnd(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the soc-flickr-und graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of soc-flickr-und graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{mislove2008growth,
	        title={Growth of the flickr social network},
	        author={Mislove, Alan and Koppula, Hema Swetha and Gummadi, Krishna P and Druschel, Peter and Bhattacharjee, Bobby},
	        booktitle={Proceedings of the first workshop on Online social networks},
	        pages={25--30},
	        year={2008},
	        organization={ACM}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocFlickrUnd",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the soc-flickr-und graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of soc-flickr-und graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{mislove2008growth,
        title={Growth of the flickr social network},
        author={Mislove, Alan and Koppula, Hema Swetha and Gummadi, Krishna P and Druschel, Peter and Bhattacharjee, Bobby},
        booktitle={Proceedings of the first workshop on Online social networks},
        pages={25--30},
        year={2008},
        organization={ACM}
}
#   def SocfbHaverford76( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbHaverford76(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Haverford76 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Haverford76 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbHaverford76",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Haverford76 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Haverford76 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def Libimseti( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Libimseti(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the libimseti graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of libimseti graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Libimseti",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the libimseti graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of libimseti graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Cl100001d7Trial3( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Cl100001d7Trial3(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the CL-10000-1d7-trial3 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of CL-10000-1d7-trial3 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Cl100001d7Trial3",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the CL-10000-1d7-trial3 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of CL-10000-1d7-trial3 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}
#   def Sanr40007( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def Sanr40007(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the sanr400-0-7 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of sanr400-0-7 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@misc{dimacs,
	        author={{DIMACS}},
	        title={DIMACS Challenge},
	        note={http://dimacs.rutgers.edu/Challenges/}}
	
	@article{rossi2014coloring,
	        title={Coloring Large Complex Networks},
	        author={Ryan A. Rossi and Nesreen K. Ahmed},
	        booktitle={Social Network Analysis and Mining},
	        pages={1--51},
	        year={2014}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="Sanr40007",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the sanr400-0-7 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of sanr400-0-7 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@misc{dimacs,
        author={{DIMACS}},
        title={DIMACS Challenge},
        note={http://dimacs.rutgers.edu/Challenges/}}

@article{rossi2014coloring,
        title={Coloring Large Complex Networks},
        author={Ryan A. Rossi and Nesreen K. Ahmed},
        booktitle={Social Network Analysis and Mining},
        pages={1--51},
        year={2014}
}
#   def ScShipsec5( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def ScShipsec5(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the sc-shipsec5 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of sc-shipsec5 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@inproceedings{bader2012graph,
	        title={Graph Partitioning and Graph Clustering},
	        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
	        booktitle={10th DIMACS Implementation Challenge Workshop},
	        year={2012}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="ScShipsec5",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the sc-shipsec5 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of sc-shipsec5 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@inproceedings{bader2012graph,
        title={Graph Partitioning and Graph Clustering},
        author={Bader, David A and Meyerhenke, Henning and Sanders, Peter and Wagner, Dorothea},
        booktitle={10th DIMACS Implementation Challenge Workshop},
        year={2012}
}
#   def SocfbRochester38( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def SocfbRochester38(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the socfb-Rochester38 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of socfb-Rochester38 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	
	@article{traud2012social,
	        title={Social structure of {F}acebook networks},
	        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
	        journal={Phys. A},
	        month={Aug},
	        number={16},
	        pages={4165--4180},
	        volume={391},
	        year={2012}
	}
	
	@article{Traud:2011fs,
	        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
	        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
	        journal={SIAM Rev.},
	        number={3},
	        pages={526--543},
	        volume={53},
	        year={2011}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="SocfbRochester38",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the socfb-Rochester38 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of socfb-Rochester38 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}

@article{traud2012social,
        title={Social structure of {F}acebook networks},
        author={Traud, Amanda L and Mucha, Peter J and Porter, Mason A},
        journal={Phys. A},
        month={Aug},
        number={16},
        pages={4165--4180},
        volume={391},
        year={2012}
}

@article{Traud:2011fs,
        title={Comparing Community Structure to Characteristics in Online Collegiate Social Networks},
        author={Traud, Amanda L and Kelsic, Eric D and Mucha, Peter J and Porter, Mason A},
        journal={SIAM Rev.},
        number={3},
        pages={526--543},
        volume={53},
        year={2011}
}
#   def G1( directed: bool = False, preprocess: bool = True, load_nodes: bool = True, verbose: int = 2, cache: bool = True, cache_path: str = 'graphs/networkrepository', version: str = 'latest', **additional_graph_kwargs: Dict ) -> grape.ensmallen.ensmallen.Graph:
View Source
def G1(
    directed: bool = False,
    preprocess: bool = True,
    load_nodes: bool = True,
    verbose: int = 2,
    cache: bool = True,
    cache_path: str = "graphs/networkrepository",
    version: str = "latest",
    **additional_graph_kwargs: Dict
) -> Graph:
    """Return new instance of the G1 graph.

    The graph is automatically retrieved from the NetworkRepository repository.	

    Parameters
    -------------------
    directed: bool = False
        Wether to load the graph as directed or undirected.
        By default false.
    preprocess: bool = True
        Whether to preprocess the graph to be loaded in 
        optimal time and memory.
    load_nodes: bool = True,
        Whether to load the nodes vocabulary or treat the nodes
        simply as a numeric range.
    verbose: int = 2,
        Wether to show loading bars during the retrieval and building
        of the graph.
    cache: bool = True
        Whether to use cache, i.e. download files only once
        and preprocess them only once.
    cache_path: str = "graphs"
        Where to store the downloaded graphs.
    version: str = "latest"
        The version of the graph to retrieve.	
    additional_graph_kwargs: Dict
        Additional graph kwargs.

    Returns
    -----------------------
    Instace of G1 graph.

	References
	---------------------
	Please cite the following if you use the data:
	
	```bib
	@inproceedings{nr,
	    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
	    author={Ryan A. Rossi and Nesreen K. Ahmed},
	    booktitle = {AAAI},
	    url={http://networkrepository.com},
	    year={2015}
	}
	```
    """
    return AutomaticallyRetrievedGraph(
        graph_name="G1",
        repository="networkrepository",
        version=version,
        directed=directed,
        preprocess=preprocess,
        load_nodes=load_nodes,
        verbose=verbose,
        cache=cache,
        cache_path=cache_path,
        additional_graph_kwargs=additional_graph_kwargs
    )()

Return new instance of the G1 graph.

The graph is automatically retrieved from the NetworkRepository repository.

Parameters
  • directed (bool = False): Wether to load the graph as directed or undirected. By default false.
  • preprocess (bool = True): Whether to preprocess the graph to be loaded in optimal time and memory.
  • load_nodes (bool = True,): Whether to load the nodes vocabulary or treat the nodes simply as a numeric range.
  • verbose (int = 2,): Wether to show loading bars during the retrieval and building of the graph.
  • cache (bool = True): Whether to use cache, i.e. download files only once and preprocess them only once.
  • cache_path (str = "graphs"): Where to store the downloaded graphs.
  • version (str = "latest"): The version of the graph to retrieve.
  • additional_graph_kwargs (Dict): Additional graph kwargs.
Returns

- Instace of G1 graph.: References

Please cite the following if you use the data:

@inproceedings{nr,
    title = {The Network Data Repository with Interactive Graph Analytics and Visualization},
    author={Ryan A. Rossi and Nesreen K. Ahmed},
    booktitle = {AAAI},
    url={http://networkrepository.com},
    year={2015}
}