<link href="css/styles.css" rel="stylesheet">

    <div class="row row-header"> ... </div>

    <div class="row row-content"> ... </div>

    <div class="row row-content"> ... </div>

    <div class="row row-content"> ... </div>

    <footer class="footer"> ... </footer>

.jumbotron {
    padding:70px 30px 70px 30px;
    margin:0px auto;
    background: #9575CD ;
    color:floralwhite;
}

address{
    font-size:80%;
    margin:0px;
    color:#0f0f0f;
}

/*
Steps:-
    1)initialise two arrays in,low and vairable Time = 0;

    2) first mark the node visited

    3)initiliase the low[curr] & in[curr] to Time and increment time by 1

    4)loop over the adjacency list of curr

    5)Most important the following three condition's for child

        -> if Child is equal to parent of curr ---> continue

        -> if Child is visited(this means that this is a back edge)
            --> make the low of curr min of low of curr or min in child
            i.e low[curr] = min(low[curr],in[child])

        -> if Child is not visited(this means that this is a forward edge)
            --> call dfs passing parent as curr node
            --> if,low[child] is greater than in[curr] this is bridge
            i.e. if(low[child]>in[curr])---->this is a bridge

            --> at last,while backtracking change the low of curr to min of curr or min of low of child
            i.e. low[curr] = min(low[curr],low[child])




The main thing here, is that we are storing for each node can it be reached from any other node
    ->if yes then that edge is not a bridge
    ->if no it is a bridge
*/

vector<ll> g[100001];
vector<bool> visi(100001, false);

vector<ll> low(100001), in(100001); // arrrays for keeping the low and in time of node
ll Time = 0;                        // time variable

void detectBridge(ll s, ll par)
{
    low[s] = in[s] = Time;
    Time++;
    visi[s] = true;

    for (ll child : g[s])
    {
        if (child == par) // if child is equal to parent continue
            continue;

        else if (visi[child]) // if child is visited and also is not a parent
        {
            // change the low time of curr to min of low of curr or in of child
            low[s] = min(low[s], in[child]);
        }
        else
        {
            // if child is not visited

            detectBridge(child, s); // call dfs further

            // condition for checking the bridge
            if (low[child] > in[s]) // if the low[child] is more than curr this is a brigde
            {
                cout << s << "-->" << child << endl;
            }

            // while backtracking change the low of curr to min of low of curr or low of child
            low[s] = min(low[s], low[child]);
        }
    }
}

/*
Steps:-
    1)initialise two arrays in,low and vairable Time = 0;

    2) first mark the node visited

    3)initiliase the low[curr] & in[curr] to Time and increment time by 1

    4)loop over the adjacency list of curr

    5)Most important the following three condition's for child

        -> if Child is equal to parent of curr ---> continue

        -> if Child is visited(this means that this is a back edge)
            --> make the low of curr min of low of curr or min in child
            i.e low[curr] = min(low[curr],in[child])

        -> if Child is not visited(this means that this is a forward edge)
            --> call dfs passing parent as curr node
            --> if,low[child] is greater than in[curr] this is bridge
            i.e. if(low[child]>in[curr])---->this is a bridge

            --> at last,while backtracking change the low of curr to min of curr or min of low of child
            i.e. low[curr] = min(low[curr],low[child])




The main thing here, is that we are storing for each node can it be reached from any other node
    ->if yes then that edge is not a bridge
    ->if no it is a bridge
*/

vector<ll> g[100001];
vector<bool> visi(100001, false);

vector<ll> low(100001), in(100001); // arrrays for keeping the low and in time of node
ll Time = 0;                        // time variable

void detectBridge(ll s, ll par)
{
    low[s] = in[s] = Time;
    Time++;
    visi[s] = true;

    for (ll child : g[s])
    {
        if (child == par) // if child is equal to parent continue
            continue;

        else if (visi[child]) // if child is visited and also is not a parent
        {
            // change the low time of curr to min of low of curr or in of child
            low[s] = min(low[s], in[child]);
        }
        else
        {
            // if child is not visited

            detectBridge(child, s); // call dfs further

            // condition for checking the bridge
            if (low[child] > in[s]) // if the low[child] is more than curr this is a brigde
            {
                cout << s << "-->" << child << endl;
            }

            // while backtracking change the low of curr to min of low of curr or low of child
            low[s] = min(low[s], low[child]);
        }
    }
}

//In the content section, update all the rows as follows:

        <div class="row row-content align-items-center">
//In the footer, update the third column div that contains the social media links as follows:

                <div class="col-12 col-sm-4 align-self-center">

<!-- Update the copyright paragraph as follows:-->

           <div class="row justify-content-center">             
                <div class="col-auto">


<!--Update the inner div containing the social media links as follows:-->

                    <div class="text-center">
                     
<!--After saving all the changes, you can do a Git commit with the message 
"Bootstrap Grid Part 2" and push your changes to the online repository.--!>

userName = 'George'
if (userName) {
  console.log(`Hello, ${userName}!`)
} else console.log('Hello!')

let userQuestion = 'Is it time to start a project? '
if (userQuestion) {
  console.log(userQuestion)
  console.log(`so ${userName}, 8 ball has come up with the answer and it says:`)
  
}
/*
*/
let randomNumber = Math.floor(Math.random() * 8)
console.log(`${randomNumber}`)
let eightBall = 'Bruh'
switch (randomNumber) {
  case 0:
  console.log(`${eightBall}`)
  break;
  case 1:
  console.log('It is certain') 
  break;
  case 2:
  console.log(`It is decidedly so`)
  break;
  case 3:
  console.log(`Reply hazy try again`)
  break;
  case 4:
  console.log(`Cannot predict now`)
  break;
  case 5:
  console.log(`Do not count on it`)
  break;
  case 6:
  console.log(`My sources say no`)
  break;
  case 7:
  console.log(`Outlook not so good`)
  break;
  case 8:
  console.log(`Signs point to yes`)
  break;
}

Add a Summary Block (List Design). To better understand the concepts applied on this snippet, please check-out our Module 5 Pseudo Elements.


/// MOBILE


SECTION-SELECTOR {

@media screen and (max-width:767px) {
  .sqs-block-summary-v2 {
     margin-left:17px;
  }
  .sqs-block-summary-v2::before {
  content:"";
  position:absolute;
  left:0%;
  height:100%;
  width:1px;
  background:red;
 
}
  
  .summary-item::before {
  content:"";
  position:absolute;
  height:10px;
  width:10px;
  background:red;
  border-radius:50%;
  left:-5px;
    border:1px solid black;
}
  
}

}




/// DESKTOP

SECTION-SELECTOR {

@media screen and (min-width:768px) {
.summary-item-list::before {
  content:"";
  position:absolute;
  left:50%;
  transform:translateX(-50%);
  height:100%;
  width:2px;
  background:#9D503E;
 
}

.summary-item:nth-child(odd)::before {
  content:"";
  position:absolute;
  height:10px;
  width:10px;
  background:#4E5851;
  border-radius:50%;
  left:-22px;
    border:1px solid #9D503E;
}

.summary-item:nth-child(even)::after {
  content:"";
  position:absolute;
  height:10px;
  width:10px;
  background:#4E5851;
  border-radius:50%;
  right:-7px;
  border:1px solid #9D503E;
}

.sqs-block:last-child {
  padding-bottom:0px !important;
}

.summary-item:nth-child(odd) {
position:relative;
  left:50%;
  width:50%;
  margin-left:17px;
 
}

.summary-item:nth-child(even) {
  display:flex;
  flex-direction:row-reverse;
  position:relative;
  width:50%;
  
  .summary-content {
    text-align:right !important;
  }
  
  .summary-title, .summary-excerpt p, .summary-metadata {
    text-align:right !important;
    margin-right:17px;
    
  }
}
  

}

}

@(Html.Kendo().Chart()
      .Name("Chart")
      .Series(series => {
         foreach (var def in Model.Series) {
           series.Column(def.Data).Name(def.Name).Stack(def.Stack);
         }
      })
      .CategoryAxis(axis => axis
         .Categories(Model.Categories)
      )
  )

@(Html.Kendo().Chart()
      .Name("Chart")
      .Series(series => {
         foreach (var def in Model.Series) {
           series.Column(def.Data).Field(def.Field).Name(def.Name).Stack(def.Stack);
         }
      })
      .CategoryAxis(axis => axis
         .Categories(Model.Categories)
      )
  )

pd.set_option('display.max_column', None)
pd.set_option('display.max_rows', None)
pd.set_option('display.max_seq_items', None)
pd.set_option('display.max_colwidth', 500)
pd.set_option('expand_frame_repr', True)

<main class="bg-gray-50 dark:bg-gray-900">

<iframe src="https://quizlet.com/660988288/match/embed?i=1ktsv2&x=1jj1" height="500" width="100%" style="border:0"></iframe>

import java.util.*;
public class searchmatrix
{
	public static void main(String[] args)
	{
		int[][] matrix = { { 1, 3, 5, 7 }, { 10, 11, 16, 20 }, { 23, 30, 34, 60 } };
		System.out.println(search(matrix, 10));

	}

	public static boolean search(int[][] matrix, int target)
	{
		int r = 0, c = matrix[0].length - 1;
		while (r >= 0 && r < matrix.length && c >= 0 && c < matrix[0].length)
		{
			if (matrix[r][c] < target)
			{
				r++;
			}
			else if (matrix[r][c] > target)
			{
				c--;
			}
			else
			{
				return true;
			}
		}
		return false;
	}

}

import java.util.*;

class BinarySearch
{
    int binarySearch(int arr[], int start, int end, int x)
    {
        if(end>=start)
        {
            int mid = start+(end-start)/2;
            
            if(arr[mid]==x)
               return mid; 
            else if(arr[mid]>x)
                return binarySearch(arr, start, mid - 1, x);
            else if(arr[mid]<x)
                return binarySearch(arr, mid+1, end, x);
        }
        return -1;
    }
    
    public static void main(String[] args)
    {
        BinarySearch s = new BinarySearch();
        int arr[] = {2, 3, 5, 7, 17, 22, 25, 31};
        int n = arr.length;
        int x = 17;
        int result = s.binarySearch(arr, 0, n - 1, x);
        
        if(result == -1)
        System.out.println("Element not Found");
        else
        System.out.println("Element Found at index = " + result);
        
    }   
}

public class Customer {
    private String name;
    private int points;
  
    public boolean hasOverHundredPoints() {
        return this.points > 100;
    }
}
 
public class Customers {

    public List<Customer> getCustomers(){
        return this.customers
        .stream()
        .filter(Customer::hasOverHundredPoints)
        .collect(Collectors.toList());

    }
}

    // https://www.baeldung.com/java-stream-findfirst-vs-findany
    public Customer getCustomerByName(String name){
    
        
        return customers
        .stream()
        .filter(
            c -> c.getName().equals(name)
        )
        .findFirst()
        .orElseThrow(null); // There should be an exception here instead of null.
    }

   public List<Customer> getCustomers1(){
       return this.customers
      .stream()
      .filter(c -> c.getPoints() > 100)
      .collect(Collectors.toList());

    } 

import java.util.*;

class BinarySearch
{
    int binarySearch(int arr[], int start, int end, int x)
    {
        if(end>=start)
        {
            int mid = start+(end-start)/2;
            
            if(arr[mid]==x)
               return mid; 
            else if(arr[mid]<x)
                return binarySearch(arr, start, mid - 1, x);
            else if(arr[mid]>x)
                return binarySearch(arr, mid+1, end, x);
        }
        return -1;
    }
    
    public static void main(String[] args)
    {
        BinarySearch s = new BinarySearch();
        int arr[] = {72, 63, 55, 47, 37, 22, 15, 1};
        int n = arr.length;
        int x = 22;
        int result = s.binarySearch(arr, 0, n - 1, x);
        
        if(result == -1)
        System.out.println("Element not Found");
        else
        System.out.println("Element Found at index = " + result);
        
    }
    
    
}

#Set Value
avec #Ajax Callback + #SweetAlert2
Process Ajax Callback PL/SQL
GET_DEPT_INFO
declare
l_location dept.loc%TYPE;
l_no_emp number;

begin

select DEPT.LOC  LOC,
    count(EMP.EMPNO)  EMPNO 
    
into l_location , l_no_emp

 from DEPT DEPT,
    EMP EMP 
 where DEPT.DEPTNO = EMP.DEPTNO(+)
 and DEPT.DEPTNO = :P22_DEPTNO
 group by dept.loc;

apex_json.open_object;
apex_json.write(
    p_name= ('LOC'),
    p_value = l_location
);
apex_json.write (
    p_name = ('EMPNO'),
    p_value = l_no_emp
);
 apex_json.close_object;
 end;
Action dynamique JS code
apex.server.process("GET_DEPT_INFO", {
    pageItems: "#P22_DEPTNO"
},
{

    success: function(data){
        $s("P22_LOCATION",data.LOC);
        $s("P22_NO_EMP",data.EMPNO);
    }
}

);


Utiliser Sweet Alert 2 pour confirmer
Set Value avec Ajax Callback

const swalWithBootstrapButtons = Swal.mixin({
  customClass: {
    confirmButton: 'btn btn-success',
    cancelButton: 'btn btn-danger'
     
  },
  buttonsStyling: false
})
swalWithBootstrapButtons.fire({
  title: 'tu veux valider DA Set Value?',
  text: "Tu confirmes cette Action SetValue!",
  icon: 'warning',
  showCancelButton: true,
  confirmButtonText: 'Valider!',
  cancelButtonText: 'Annuler!',
  reverseButtons: true
}).then((result) = {
  if (result.isConfirmed) {
      apex.da.cancel();
    swalWithBootstrapButtons.fire(
      'Valider !',
      'l’opération SetValue a été bien exécuté.',
      'success'
    )

  } else if (
    /* Read more about handling dismissals below */
    result.dismiss === Swal.DismissReason.cancel
  ) {

    swalWithBootstrapButtons.fire(
      'Annuler',
      'l’opération SetValue a été annulé :)',
      'error'
    )
    
  }
})

!git clone https://git_token@github.com/username/repository.git

<img class="mantra-avatar mantra-avatar-large " src="https://picsum.photos/200/300 " alt="avatar-image1 " />
<img class="mantra-avatar mantra-avatar-medium " src="https://picsum.photos/200/300 " alt="avatar-image2 " />
<img class="mantra-avatar mantra-avatar-small " src="https://picsum.photos/200/300 " alt="avatar-image3 " />

<link rel="stylesheet" href="https://mantraui.netlify.app/component/component.css">

<div class="mantra-badge ">
    <span class="mantra-icon ">
        <i class="fa fa-twitter "></i>
        <span class="mantra-count ">7</span>
    </span>

    <span class="mantra-icon ">
        <i class="fa fa-camera "></i>
        <span class="mantra-count ">20</span>
    </span>

    <span class="mantra-icon ">
        <i class="fa fa-instagram "></i>
        <span class="mantra-count ">16</span>
    </span>
</div>

    <div class="mantra-badge-lg ">
        <img class="mantra-avatar mantra-avatar-large " src="https://picsum.photos/200/300 " alt="avatar-image1 " />
        <span class="mantra-circle mantra-circle-lg "></span>
    </div>

    <div class="mantra-badge-md ">
        <img class="mantra-avatar mantra-avatar-medium " src="https://picsum.photos/200/300 " alt="avatar-image3 " />
        <span class="mantra-circle mantra-circle-md "></span>
    </div>
    <div class="mantra-badge-sm ">
        <img class="mantra-avatar mantra-avatar-small " src="https://picsum.photos/200/300 " alt="avatar-image2 " />
        <span class="mantra-circle mantra-circle-sm "></span>
    </div>

<div class="mantra-alert">This is info alert</div>
<div class="mantra-alert mantra-alert-success">This is success alert.</div>
<div class="mantra-alert mantra-alert-danger">This is danger alert.</div>
<div class="mantra-alert-warning mantra-alert">This is warning alert.</div>

<button class="mantra-button mantra-primary-btn mantra-large-btn ">Primary-solid</button>
<button class="mantra-button mantra-primary-btn ">Primary-solid</button>
<button class="mantra-button mantra-primary-btn mantra-small-btn ">Small-btn</button>

<div class="mantra-link-button ">
    <a href="# " class="mantra-link mantra-large-btn ">Primary link</a>
    <a href=" # " class="mantra-link mantra-primary-btn ">Link button</a>
    <a href="# " class="mantra-link mantra-small-btn ">Link button</a>

</div>

<button class="mantra-button mantra-primary-btn mantra-large-btn ">
 <i class="fa fa-shopping-cart "></i>Cart
</button>
<button class="mantra-button mantra-primary-btn ">
<i class="fa fa-facebook "></i>Facebook
</button>
<button class="mantra-button mantra-primary-btn mantra-small-btn ">
<i class="fa fa-share "></i>Share
</button>

<div class="mantra-floating-box ">
    <div class="mantra-floating-btn ">
        <i class="fa fa-facebook "></i>
    </div>
    <div class="mantra-floating-btn ">
        <i class="fa fa-plus "></i>
    </div>
</div>

<button class="mantra-button mantra-outline-btn ">Primary-outline</button>
<button class="mantra-button mantra-outline-btn mantra-large-btn ">Primary-solid</button>
<button class="mantra-button mantra-outline-btn mantra-small-btn ">Small-btn</button>

<div class="mantra-card-holder ">
    <div class="mantra-card-holder-image ">
        <span class="mantra-badge-card card-badge">Best Seller</span>
        <img class="mantra-card-image " src="https://picsum.photos/200/300 " />

    </div>

    <div class="mantra-card-holder-text ">
        <h2>Heading</h2>
        <div>
            <h4>Sub Heading</h4>
            <p>
                Lorem ipsum dolor sit amet consectetur adipisicing elit. Accusamus, error accusantium eius fuga. Ut sunt earum et dignissimos tempore in omnis veniam a quis officia qui iure architecto. Rem incidunt repudiandae aut fugit rerum non dignissimos molestiae
                ut provident distinctio rem sequi quaerat.
            </p>
            <span class="mantra-discount ">Rs.2000 </span>
            <span class="mantra-original "> Rs.2500</span>
        </div>
        <div class="mantra-card-btn ">
            <button class="mantra-button mantra-primary-btn ">
                <i class="fa fa-shopping-cart "></i>
                Add to cart
            </button>
        </div>
    </div>
</div>

<div class="mantra-vertical-card ">
    <div class="mantra-card-holder-image-v ">
        <img class="mantra-vert-image " src="https://picsum.photos/200/300 " />
    </div>
    <div class="mantra-card-holder-text-vert ">
        <div class="mantra-card-holder-text-content ">
            <h2>Heading</h2>
            <h4>Sub Heading</h4>
            <span class="mantra-discount ">Rs.300</span>
            <span class="mantra-original ">Rs.400</span>
        </div>
    </div>
    <div class=" mantra-card-btn ">
        <button class="mantra-button mantra-primary-btn ">
            <i class="fa fa-shopping-cart "></i>
            Add to cart
        </button>
    </div>
</div>

<div class="mantra-vertical-card ">
    <div class="mantra-icon mantra-close-icon ">
        <i class="fa fa-times-circle-o " aria-hidden="true "></i>
    </div>
    <div class="mantra-card-holder-image-v ">
        <img class="mantra-vert-image " src="https://picsum.photos/200/300 " />
    </div>
    <div class="mantra-card-holder-text-vert ">
        <div class="mantra-card-holder-text-content ">
            <h2>Heading</h2>
            <h4>Sub Heading</h4>
            <span class="mantra-discount ">Rs.300</span>
            <span class="mantra-original ">Rs.400</span>
        </div>
    </div>
    <div class=" mantra-card-btn ">
        <button class="mantra-button mantra-primary-btn ">
            <i class="fa fa-shopping-cart "></i>
            Add to cart
        </button>
    </div>

</div>

<div class="mantra-vertical-card mantra-text-overlay-card ">
    <div class="mantra-icon mantra-close-icon ">
        <i class="fa fa-times-circle-o " aria-hidden="true "></i>
    </div>
    <div class="mantra-card-holder-image-v ">
        <img class="mantra-vert-image " src="https://picsum.photos/200/300 " />
    </div>
    <div class="mantra-card-holder-text-vert ">
        <div class="mantra-card-holder-text-content ">
            <h2>Heading</h2>
            <h4>Sub Heading</h4>
            <span class="mantra-discount ">Rs.300</span>
            <span class="mantra-original ">Rs.400</span>
        </div>
    </div>
    <div class=" mantra-card-btn ">
        <button class="mantra-button mantra-primary-btn ">
            <i class="fa fa-shopping-cart "></i>
            Add to cart
        </button>
    </div>
    <div class="mantra-text-overlay ">
        <span>Out of Stock</span>
    </div>
</div>

<div class="mantra-text-card ">
    <h2>Heading</h2>
    <h4>Sub Heading</h4>
    <p>
        Lorem ipsum dolor sit amet consectetur adipisicing elit. Accusamus, error accusantium eius fuga. Ut sunt earum et dignissimos tempore in omnis veniam a quis officia qui iure architecto. Rem incidunt repudiandae aut fugit rerum non
    </p>
    <button class="mantra-button mantra-primary-btn ">Contact</button>
</div>

<div class="mantra-responsive-image ">
    <img src="https://picsum.photos/200/200 " />
</div>

<div class="mantra-responsive-image mantra-image-rounded ">
    <img src="https://picsum.photos/200/200 " />
</div>

<input class="mantra-textbox-classic mantra-highlight-box " type="text ">

<label for="email "></label>
<input id="email " class="mantra-textbox-classic mantra-highlight-box " type="email " placeholder=" Enter Email " required />

<label for="pass "></label>
<input id="pass " class="mantra-textbox-classic mantra-highlight-box " type="password " placeholder=" Enter Password " required />

<div class=" mantra-error-input ">
    <input id="mantra-error" class="mantra-textbox-classic " placeholder=" " />
    <label for="mantra-error ">Error </label>
</div>
<div class=" mantra-warning-input ">
    <input id="mantra-warning" class="mantra-textbox-classic " placeholder=" " />
    <label for="mantra-warning ">Warning </label>
</div>

<div class="mantra-success-input ">
    <input id="mantra-success" class="mantra-textbox-classic " placeholder=" " />
    <label for="mantra-success ">Success </label>
</div>

#870e7f

# floor division operator, //, divides two numbers and rounds down to an integer
135 // 60
>> 2

# modulus operator, %, divides two numbers and returns remainder
135 % 60
>> 15

# Applications of modulus operator:
# if (x % y ) is zero, then x is divisible by y
# extract right-most digit(s) from number: e.g., x % 10 extracts right-most digit of x (in base 10); similarly x % 100 yields last two digits

# 1e-15 is Python notation for 10**(-15)

# it my be useful to have a body with no statements (as a placeholder for code to be written later) >> use the pass statement, which does nothing
if x < 0:
  pass

# a return statement without an expression exits the function and immediately returns to the caller; the remaining lines of the function don't run
def print(s, n):
  if n <= 0:
    return
  print(s)

//Edit articulation point here from editor later

/*
    Whenever,in question there is something about dependency i.e if there is given something that this depend on other then first think of topological sort.


    Topological sort:-
            -> can be applied only on DAG->directed acyclic graph
            ->if there is directed edge from a to b then a will always come before the b in topo sort.


    How to find:-
        -> first algo
            ->while doing normal dfs after traversing the whole adjacency list push the curr node in stack and then after whole dfs just print the stack by poping each element.

        ->second algo
            ->KHANS's Algorithm
                Steps:-
                    1)give the indegree to each node while building the graph

                    2)now start from the node which has indegree 0 and push them into the queue

                    3)while,traversing the adjancecy list decrease the indegree of each child node

                    4)now,push only those element in the queue which has indegree 0

                    5)loop this till queue does not become empty

*/

typedef long long ll;
vector<ll> g[100001], visi(100001, 0), in(100001, 0);

//----------------------------------------------------------------------------------------

// dfs based approach
void topoSortUsingDfs(ll s, stack<ll> &st)
{
    if (visi[s])
        return;
    visi[s] = true;
    for (ll child : g[s])
    {
        if (visi[child] == false)
            topoSortUsingDfs(child, st);
    }

    st.push(s); // at last pushing the curr vertex in stack
}
    /*
       -->dfs based approach implementation in main function
       stack<ll> st;
       for (int i = 0; i < n; i++)
           if (visi[i] == false)
               topoSortUsingDfs(i, st);

       while (!st.empty())
       {
           cout << st.top() << " ";
           st.pop();
       }
    */

//----------------------------------------------------------------------------------------

// Khan's Algorithm
void khanAlgo(ll n)
{
    queue<ll> q;
    for (int i = 0; i < n; i++)
    {
        if (in[i] == 0)
        {
            q.push(i);//firstly pushing all the vertices with indegree 0 in queue.
            visi[i] = true;
        }
    }
    vector<int> topoSort;
    while (!q.empty())
    {
        ll curr = q.front();
        q.pop();
        topoSort.push_back(curr); // pushing the curr in to vector
        for (ll child : g[curr])
        {
            if (visi[child] == false)
                in[child]--;
            if (in[child] == 0)
            {
                q.push(child); // push only those element which has indegree 0
                visi[child] = true;
            }
        }
    }
}

    /*
    //increasing the indegree of each vertex
    while (m--)
    {
        ll s, d;
        cin >> s >> d;
        g[s].push_back(d);
        in[d]++; 
    }
     */

>>> @patch.object(SomeClass, 'class_method')
... def test(mock_method):
...     SomeClass.class_method(3)
...     mock_method.assert_called_with(3)
...
>>> test()

cd existing-project
git remote set-url origin https://github.git
git push -u origin --all
git push origin --tags